352 search results - page 67 / 71 » Partitioning Graphs into Connected Parts |
VLDB
2004
ACM
15 years 2 months ago
2004
ACM
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
101
click to vote
PODC
2004
ACM
15 years 2 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
102
click to vote
MOBICOM
2003
ACM
15 years 2 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
124
click to vote
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
88
Voted
SIGCOMM
2010
ACM
14 years 9 months ago
2010
ACM
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...