Sciweavers

734 search results - page 34 / 147
» A New Indexing Method for High Dimensional Dataset
Sort
View
DEXA
2006
Springer
126views Database» more  DEXA 2006»
13 years 10 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
CIKM
2003
Springer
14 years 1 months ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
VLDB
2007
ACM
129views Database» more  VLDB 2007»
14 years 8 months ago
Efficient Skyline Computation over Low-Cardinality Domains
Current skyline evaluation techniques follow a common paradigm that eliminates data elements from skyline consideration by finding other elements in the dataset that dominate them...
Michael D. Morse, Jignesh M. Patel, H. V. Jagadish
ICIP
2010
IEEE
13 years 6 months ago
Image analysis with regularized Laplacian eigenmaps
Many classes of image data span a low dimensional nonlinear space embedded in the natural high dimensional image space. We adopt and generalize a recently proposed dimensionality ...
Frank Tompkins, Patrick J. Wolfe
MTA
1998
119views more  MTA 1998»
13 years 8 months ago
A New Indexing Scheme for Content-Based Image Retrieval
We propose a new efficient indexing scheme, called the HG-tree, to support content-based retrieval in image databases. Image content is represented by a point in a multidimensional...
Guang-Ho Cha, Chin-Wan Chung