95 search results - page 6 / 19 » Shortest Path Algorithms: An Evaluation Using Real Road Netw... |
133
click to vote
OTM
2010
Springer
15 years 2 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
132
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
120
click to vote
GIS
2009
ACM
16 years 5 months ago
2009
ACM
This paper presents a method for automatically converting raw GPS traces from everyday vehicles into a routable road network. The method begins by smoothing raw GPS traces using a...
148
Voted
WAW
2007
Springer
15 years 10 months ago
2007
Springer
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
145
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...