460 search results - page 77 / 92 » Bounding the locality of distributed routing algorithms |
INFOCOM
2000
IEEE
14 years 3 days ago
2000
IEEE
Abstract—In this paper, we present the implementation issues of a virtual backbone that supports the operations of the Uniform Quorum System (UQS) and the Randomized Database Gro...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
SOCA
2010
IEEE
13 years 6 months ago
2010
IEEE
In asynchronous event systems, the production of an event is decoupled from its consumption via an event queue. The loose coupling of such systems allows great flexibility as to ...
DCOSS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
Scientific database federations are geographically distributed and network bound. Thus, they could benefit from proxy caching. However, existing caching techniques are not suitabl...