144 search results - page 19 / 29 » A speculation-friendly binary search tree |
VRST
2009
ACM
14 years 2 months ago
2009
ACM
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...
CPC
1999
13 years 7 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
INFOCOM
2000
IEEE
14 years 23 hour ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
BIOADIT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...