3055 search results - page 200 / 611 » Randomized Search Trees |
104
click to vote
ICIP
1995
IEEE
16 years 2 months ago
1995
IEEE
Recently a class of multiscale stochastic models has been introducedin which Gaussian random processes are described by scale-recursive dynamics that are indexed by the nodes of a...
110
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
123
Voted
WEA
2010
Springer
15 years 7 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...
128
click to vote
WEA
2010
Springer
15 years 7 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 ...
99
Voted
CLUSTER
2009
IEEE
15 years 7 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...