Sciweavers

422 search results - page 40 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
ICASSP
2010
IEEE
13 years 9 months ago
Graph based event detection from realistic videos using weak feature correspondence
We study the problem of event detection from realistic videos with repetitive sequential human activities. Despite the large body of work on event detection and recognition, very ...
Lei Ding, Quanfu Fan, Jen-Hao Hsiao, Sharath Panka...
WISE
2002
Springer
14 years 1 months ago
Mining Web Logs for Personalized Site Maps
Navigating through a large Web site can be a frustrating exercise. Many sites employ Site Maps to help visitors understand the overall structure of the site. However, by their ver...
Fergus Toolan, Nicholas Kushmerick
SIROCCO
2001
13 years 10 months ago
Competitive Online Routing in Geometric Graphs
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
Prosenjit Bose, Pat Morin
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 1 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
SIGMETRICS
2005
ACM
100views Hardware» more  SIGMETRICS 2005»
14 years 2 months ago
On AS-level path inference
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
Zhuoqing Morley Mao, Lili Qiu, Jia Wang, Yin Zhang