166 search results - page 31 / 34 » Partitioning Graphs to Speed Up Dijkstra's Algorithm |
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
— The worst-case delay/power of function units has been used in traditional high level synthesis to facilitate design space exploration. As technology scales to nanometer regime,...
GD
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
KONVENS
2000
13 years 11 months ago
2000
This paper presents details of the RWTH large vocabulary continuous speech recognition system used in the VERBMOBIL spontaneous speech translation system. In particular, we report...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
GIS
2010
ACM
13 years 5 months ago
2010
ACM
With modern LiDAR technology the amount of topographic data, in the form of massive point clouds, has increased dramatically. One of the most fundamental GIS tasks is to construct...