209 search results - page 18 / 42 » t-Spanners for metric space searching |
PRL
2010
14 years 10 months ago
2010
The nearest-neighbour (1NN) classifier has long been used in pattern recognition, exploratory data analysis, and data mining problems. A vital consideration in obtaining good res...
112
click to vote
ICIP
2003
IEEE
16 years 1 months ago
2003
IEEE
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
PAMI
2007
14 years 11 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
105
click to vote
SIGMOD
2002
ACM
16 years 3 days ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...