Sciweavers

43 search results - page 7 / 9
» Nearest Neighbor Search on Vertically Partitioned High-Dimen...
Sort
View
PAMI
2008
152views more  PAMI 2008»
13 years 5 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
13 years 11 months ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...
TMM
2002
115views more  TMM 2002»
13 years 5 months ago
Principles of schema design for multimedia databases
This paper presents the rudiments of a theory of schema design for databases containing high dimensional features of the type used for describing multimedia data. We introduce a mo...
Simone Santini, Amarnath Gupta
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 5 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
13 years 10 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...