1337 search results - page 194 / 268 » Fast computation of distance estimators |
IWANN
2001
Springer
14 years 1 months ago
2001
Springer
In this paper two methods for the detection and recognition of landmarks to be used in topological modeling for autonomous mobile robots are presented. The first method is based o...
ASSETS
2007
ACM
14 years 1 months ago
2007
ACM
We demonstrate a system designed to assist a visually impaired individual while moving in an unfamiliar environment. Small and economical color markers are placed in key locations...
FFA
2007
13 years 9 months ago
2007
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...
ADC
1999
Springer
14 years 1 months ago
1999
Springer
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...