632 search results - page 11 / 127 » On Routing in Circulant Graphs |
CVPR
2011
IEEE
13 years 5 months ago
2011
IEEE
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
HICSS
2005
IEEE
14 years 3 months ago
2005
IEEE
The Gnutella protocol requires peers to broadcast messages to their neighbours when they search files. The message passing generates a lot of traffic in the network, which degrade...
IPTPS
2004
Springer
14 years 3 months ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...