360 search results - page 55 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms o...
ICPP
2007
IEEE
15 years 3 months ago
2007
IEEE
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
85
Voted
ICPADS
2005
IEEE
15 years 3 months ago
2005
IEEE
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
95
Voted
STOC
2002
ACM
15 years 9 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...