455 search results - page 30 / 91 » Distributed Processes on Tree Hash |
112
click to vote
PARELEC
2002
IEEE
15 years 6 months ago
2002
IEEE
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
ICDCS
1996
IEEE
15 years 6 months ago
1996
IEEE
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
119
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
110
click to vote
CN
2010
15 years 2 months ago
2010
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
125
click to vote
ALGORITHMICA
1998
15 years 1 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...