Sciweavers

172 search results - page 13 / 35
» On the cost of searching signature trees
Sort
View
VTC
2010
IEEE
178views Communications» more  VTC 2010»
13 years 5 months ago
Nonparametric Belief Propagation Based on Spanning Trees for Cooperative Localization in Wireless Sensor Networks
—Nonparametric belief propagation (NBP) is one of the best-known methods for cooperative localization in sensor networks. It is capable to provide information about location esti...
Vladimir Savic, Santiago Zazo
INFOCOM
2009
IEEE
14 years 2 months ago
Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...
Mohammad Behdadfar, Hossein Saidi, Hamid Alaei, Ba...
CPC
1999
105views more  CPC 1999»
13 years 7 months ago
Total Path Length For Random Recursive Trees
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...
Robert P. Dobrow, James Allen Fill
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 27 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
INDOCRYPT
2001
Springer
13 years 12 months ago
Mobile Agent Route Protection through Hash-Based Mechanisms
Abstract. One approach to secure mobile agent execution is restricting the agent route to trusted environments. A necessary condition for this approach to be practical is that the ...
Josep Domingo-Ferrer