Sciweavers

5 search results - page 1 / 1
» Hypersphere Indexer
Sort
View
DEXA
2006
Springer
126views Database» more  DEXA 2006»
13 years 6 months ago
Hypersphere Indexer
Indexing high-dimensional data for efficient nearest-neighbor searches poses interesting research challenges. It is well known that when data dimension is high, the search time can...
Navneet Panda, Edward Y. Chang, Arun Qamra
DATESO
2004
81views Database» more  DATESO 2004»
13 years 6 months ago
Pivoting M-tree: A Metric Access Method for Efficient Similarity Search
In this paper pivoting M-tree (PM-tree) is introduced, a metric access method combining M-tree with the pivot-based approach. While in M-tree a metric region is represented by a hy...
Tomás Skopal
SIGMOD
2005
ACM
178views Database» more  SIGMOD 2005»
14 years 5 months ago
Towards Effective Indexing for Very Large Video Sequence Database
With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity sear...
Heng Tao Shen, Beng Chin Ooi, Xiaofang Zhou
BIOWIRE
2007
Springer
13 years 11 months ago
Beta Random Projection
Random projection (RP) is a common technique for dimensionality reduction under L2 norm for which many significant space embedding results have been demonstrated. In particular, r...
Yu-En Lu, Pietro Liò, Steven Hand
TKDE
2011
332views more  TKDE 2011»
12 years 11 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose