1068 search results - page 24 / 214 » Extremely randomized trees |
COMBINATORICS
2000
13 years 8 months ago
2000
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...
SIAMDM
2010
13 years 3 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
IROS
2008
IEEE
14 years 3 months ago
2008
IEEE
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
SPAA
1993
ACM
14 years 21 days ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...