680 search results - page 39 / 136 » A randomized embedding algorithm for trees |
WEA
2007
Springer
14 years 3 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
ICRA
2007
IEEE
14 years 3 months ago
2007
IEEE
— This paper describes a new extension to the Rapidly–exploring Random Tree (RRT) path planning algorithm. The Particle RRT algorithm explicitly considers uncertainty in its do...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
CIKM
2008
Springer
13 years 11 months ago
2008
Springer
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. However, many si...