133 search results - page 16 / 27 » DIJKSTRA |
ATMOS
2007
13 years 9 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
SODA
1994
ACM
13 years 9 months ago
1994
ACM
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper describes a new framework for the automated tracking of the central retinal vein in retinal images. The procedure first computes a binary image of the retinal vasculatur...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
KPN Research has developed an all-purpose check recognition system for the Dutch Postbank. This Image Recognition and Interpretation System (IRIS) is the result of more than thirt...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...