1060 search results - page 108 / 212 » On the Discovery of Random Trees |
194
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
198
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
160
click to vote
CLUSTER
2009
IEEE
16 years 1 months ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
153
click to vote
SRDS
2005
IEEE
15 years 12 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
196
click to vote
HIPC
2005
Springer
15 years 12 months ago
2005
Springer
Several challenging new applications demand the ability to do data mining on resource constrained devices. One such application is that of monitoring physiological data streams ob...