Minimum Spanning Trees

Utilities for implementing Modified Preorder Tree Traversal with your Django Models and working with trees of Model instances. For installation instructions, see the file "INSTALL" in this directory; for instructions on how to use this application, and on what it provides, see the file...

[A , c] = MinVolEllipse(P, tolerance)Finds the minimum volume enclosing ellipsoid (MVEE) of a set of data points stored in matrix P. The following optimization problem is solved:minimize log(det(A))s.t. (P_i - c)'*A*(P_i - c)

% This function allow you to bild fractal trees% by using modified algorithms based on the so-called Kantor`s array% and method of inverse trace% These methods allow you to economise time and computer memory% considerably% It`s arguments:% Fraktal(n,r,phi,xb,yb)% n - number of iterations% r -...


Platforms: Matlab

This book provides a complete analysis of the conjugate gradient and generalized minimum residual iterations.For a full book description and ordering information, please refer to http://www.mathworks.com/support/books/book1344.jsp.


Platforms: Matlab

Most Pixels Ever is an open-source Java / C++ framework for spanning Processing sketches and openFrameWorks applications across multiple screens.


Platforms: Mac

Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected un directed weighted graphThe zip file containskruskal.m iscycle.m fysalida.m connected.mIf we want to find the minimum spanning tree. We call function kruskal.% Input: PV = nx3 martix. 1st and...


Platforms: Matlab

This function computes the minimum euclidean distance between two polygons P1 & P2.- for vertex-vertex case


Platforms: Matlab

Specify a vecter, a minimum peak separation, and a minimum peak height, and this function will find the peaks.. about 250 times faster than findpeaks would!try:t=linspace(0,1,10001);x=sin(2*pi*20*t)+0.2*sin(2*pi*113*t)+.2*randn(size(t));p=peakseek(x,10000,1);


Platforms: Matlab

Calculate minimum of single variable function using 3-point searchUsage:estimated_min=three_point(sfun,a,b,tolerance) sfun: Symbolic/String function a: Inferior Limit b: Superior Limit tolerance: Tolerance Range


Platforms: Matlab

B3MSV Bidirectional Branch and Bound(B3) subset selection using the the Minimum Singular Value (MSV) as the criterion.Consider the following subset selection problem:Given a tall (m x n, m>n) matrix, A, to find n rows of A such that the resulted n x n square submatrix has the largest MSV among...


Platforms: Matlab

A program to calculate spherical Besselfunctions with minimum effort.


Platforms: Matlab

elko Visitation Model can be use to manipulate hierarchic trees of records stored in a MySQL database using Joe Celko visitation model. It can perform the following tasks in a very effecient way mostly using one SELECT query statement.Features of Celko Visitation Model:- Find out leaf nodes in...


Platforms: PHP

ClipAssist will sit in the background and give you quick access to those clips, in unstyled text so that you can paste anywhere with the minimum fuss. Start up ClipAssist, press the [+] button, give it a name and paste in your first clip.


Platforms: Mac

The bintrees package provides Binary- RedBlack- and AVL-Trees written in Python and Cython. This Classes are much slower than the bulitin.dict class and uses twice as much memory, but they have always sorted keys, and all results of iterators and list returning functions are also sorted. All...


Platforms: *nix

Truecrypt Installer for Debian helps to get Truecrypt running with a minimum of effort under Debian-based Linux systems. Truecrypt is an Open Source disk encryption software which uses a concept of containers to store encrypted data. The nice thing about Truecrypt is that the containers (or...


Platforms: *nix

PhyloWidget is a program for viewing, editing, and publishing phylogenetic trees online. It is small, contains a simple yet powerful user interface, and contains many novel features not available in other phylogenetic viewers. PhyloWidget is specifically designed for: * Visually exploring...


Platforms: Mac

Random Projection Trees is a recursive space partitioning datastructure which can automatically adapt to the underlying (linear or non-linear) structure in data. It has strong theoretical guarantees on rates of convergence and works well in practice.


Platforms: *nix

A program to compute the minimum weight triangulation of a (simple) polygon with holes (or pointgon for short). The four algorithms underlying this program are based on recursively cutting out triangles, one side of which is on the perimeter (an very simple idea proposed in [Grantson et al....


Platforms: Mac

TreeViewJ is an open source, cross-platform tool for viewing and analyzing phylogenetic trees. It provides the user with the capability to rename, color, and adjust the width of nodes and branches to produce publication-quality images. If dates are available for taxa, the software can map them...


Platforms: Mac

mirdir is a tool that allows you to synchronize two directory trees in a fast way. Only the differences between the two sets of files are copied while the excess files/directories in the destination tree are removed (unless there was an explicit request to keep them).


Platforms: *nix