360 search results - page 13 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
106
click to vote
NSDI
2004
14 years 11 months ago
2004
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
BIOINFORMATICS
2011
14 years 1 months ago
2011
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...
STOC
2003
ACM
15 years 9 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
188
click to vote
TKDE
2012
12 years 12 months ago
2012
—Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of som...