564 search results - page 4 / 113 » Linear Time Algorithms for Exact Distance Transform |
VLDB
2001
ACM
14 years 4 days ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
ICRA
2002
IEEE
14 years 20 days ago
2002
IEEE
A new extremal distance tracking algorithm is presented for parametric curves and surfaces undergoing rigid body motion. The essentially geometric extremization problem is transfo...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....