Sciweavers

402 search results - page 71 / 81
» Nearest Surrounder Queries
Sort
View
AAAI
2011
12 years 7 months ago
Cross-Language Latent Relational Search: Mapping Knowledge across Languages
Latent relational search (LRS) is a novel approach for mapping knowledge across two domains. Given a source domain knowledge concerning the Moon, “The Moon is a satellite of the...
Nguyen Tuan Duc, Danushka Bollegala, Mitsuru Ishiz...
ICCV
2009
IEEE
15 years 19 days ago
Mode-Detection via Median-Shift
Median-shift is a mode seeking algorithm that relies on computing the median of local neighborhoods, instead of the mean. We further combine median-shift with Locality Sensitive...
Lior Shapira, Shai Avidan, Ariel Shamir
ICCV
2007
IEEE
14 years 9 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas
ICDE
1999
IEEE
209views Database» more  ICDE 1999»
14 years 9 months ago
Efficient Time Series Matching by Wavelets
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
Kin-pong Chan, Ada Wai-Chee Fu
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 7 months ago
Efficient k-NN search on vertically decomposed data
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...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...