824 search results - page 23 / 165 » Efficient Distance Computation Between Non-Convex Objects |
148
Voted
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
102
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
There are two substantial open issues in the field of the image retrieval: semantic gap between computationally extracted low-level features and human operated high-level concepts...
174
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
126
Voted
ICDE
2007
IEEE
15 years 9 months ago
2007
IEEE
With the rapid progress of mobile devices and positioning technologies, Trajectory Databases (TD) have been in the core of database research during the last decade. Analysis and k...
142
Voted
SIAMCOMP
2000
15 years 3 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...