241 search results - page 12 / 49 » Efficient Parallel Algorithms for Euclidean Distance Transfo... |
147
Voted
ICIP
2005
IEEE
16 years 4 months ago
2005
IEEE
Recently, it was proven empirically that facial expressions can be modelled as isometries, that is, geodesic distances on the facial surface were shown to be significantly less se...
123
Voted
DMKD
2003
ACM
15 years 7 months ago
2003
ACM
The parallel explosions of interest in streaming data, and data mining of time series have had surprisingly little intersection. This is in spite of the fact that time series data...
116
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper addresses the image registration problem applying genetic algorithms. The image registration’s objective is the definition of a mapping that best match two set of poi...
119
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
123
Voted
VLDB
1997
ACM
15 years 6 months ago
1997
ACM
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...