Sciweavers

9 search results - page 2 / 2
» The Colored Sector Search Tree: A Dynamic Data Structure for...
Sort
View
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
14 years 6 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
ADC
2007
Springer
183views Database» more  ADC 2007»
13 years 8 months ago
Efficient Similarity Search by Summarization in Large Video Database
With the explosion of video data, video processing technologies have advanced quickly and been applied into many fields, such as advertisements, medical etc.. To fast search these...
Xiangmin Zhou, Xiaofang Zhou, Heng Tao Shen
EDBT
2008
ACM
132views Database» more  EDBT 2008»
14 years 4 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,...
NIPS
2004
13 years 6 months ago
An Investigation of Practical Approximate Nearest Neighbor Algorithms
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...