390 search results - page 60 / 78 » Computing shortest paths for any number of hops |
126
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
119
Voted
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
The study of 2D shapes and their similarities is a central problem in the field of vision. It arises in particular from the task of classifying and recognizing objects from their ...
PODC
2003
ACM
15 years 7 months ago
2003
ACM
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
NSDI
2004
15 years 3 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
111
click to vote
MOBISYS
2007
ACM
16 years 1 months ago
2007
ACM
Abstract-- Wireless sensor networks represent a key technology enabler for enhanced health care and assisted living systems. Recent standardization efforts to ensure compatibility ...