28 search results - page 4 / 6 » Partially Dynamic Algorithms for Distributed Shortest Paths ... |
147
click to vote
WIDM
2004
ACM
15 years 9 months ago
2004
ACM
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
152
click to vote
BCS
2008
15 years 5 months ago
2008
Much of the traffic carried by Sensor Networks will originate from routine measurements or observations by sensors which monitor a particular situation, such as the temperature an...
137
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...
131
Voted
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
This paper studies the problem of evaluating continuous multi-way joins on top of Distributed Hash Tables (DHTs). We present a novel algorithm, called recursive join (RJoin), that...
163
click to vote
SIGMETRICS
2011
ACM
14 years 6 months ago
2011
ACM
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...