360 search results - page 21 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
169
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
174
Voted
GIS
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
SPAA
2004
ACM
15 years 2 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...