Sciweavers

52 search results - page 10 / 11
» Querying high-dimensional data in single-dimensional space
Sort
View
KDD
2004
ACM
216views Data Mining» more  KDD 2004»
14 years 6 months ago
GPCA: an efficient dimension reduction scheme for image compression and retrieval
Recent years have witnessed a dramatic increase in the quantity of image data collected, due to advances in fields such as medical imaging, reconnaissance, surveillance, astronomy...
Jieping Ye, Ravi Janardan, Qi Li
BTW
2009
Springer
240views Database» more  BTW 2009»
13 years 6 months ago
Efficient Adaptive Retrieval and Mining in Large Multimedia Databases
Abstract: Multimedia databases are increasingly common in science, business, entertainment and many other applications. Their size and high dimensionality of features are major cha...
Ira Assent
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...
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 7 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
CVPR
2007
IEEE
14 years 7 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor