1337 search results - page 89 / 268 » Fast computation of distance estimators |
IWVF
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. In this paper we propose two techniques to qualitatively estimate distance in monocular vision. Two kinds of approaches are described, the former based on texture analysi...
CPM
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
Many algorithms have been proposed for the problem of time series classification. However, it is clear that one-nearest-neighbor with Dynamic Time Warping (DTW) distance is except...
SDM
2007
SIAM
13 years 11 months ago
2007
SIAM
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis ...
TMM
2008
13 years 9 months ago
2008
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis p...