374 search results - page 25 / 75 » Evaluating path queries over route collections |
CONEXT
2009
ACM
14 years 10 months ago
2009
ACM
This paper presents the design and evaluation of SafeGuard, an intra-domain routing system that can safely forward packets to their destinations even when routes are changing. Saf...
67
Voted
WWW
2006
ACM
15 years 10 months ago
2006
ACM
In this poster, we present a method for extracting queries related to real-life events, or news-related queries, from large web query logs. The method employs query frequencies an...
102
Voted
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
100
Voted
IJCV
2008
14 years 9 months ago
2008
This work achieves an efficient acquisition of scenes and their depths along long streets. A camera is mounted on a vehicle moving along a straight or a mildly curved path and a sa...
INFOCOM
2012
IEEE
13 years 2 days ago
2012
IEEE
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...