1154 search results - page 120 / 231 » On the editing distance of graphs |
143
click to vote
ATMOS
2009
15 years 7 months ago
2009
We present a set of three new time-dependent models with increasing flexibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while m...
148
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...
173
click to vote
PAMI
2006
15 years 6 months ago
2006
High dimensional structured data such as text and images is often poorly understood and misrepresented in statistical modeling. The standard histogram representation suffers from ...
185
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
165
click to vote
APPROX
2009
Springer
16 years 29 days ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...