Sciweavers

9 search results - page 2 / 2
» Speeding Up Shortest Path Search in Public Transport Network...
Sort
View
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 2 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
ICIW
2008
IEEE
14 years 2 months ago
Web Application to Generate Route Bus Timetables
—Bus route system is the fundamental transportation device for aged people and students, and has an important role in every province. However, passengers decreases year by year, ...
Kazunori Toshioka, Takao Kawamura, Kazunori Sugaha...
VLDB
2004
ACM
187views Database» more  VLDB 2004»
14 years 26 days ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi