Sciweavers

53 search results - page 4 / 11
» On Space Efficient Two Dimensional Range Minimum Data Struct...
Sort
View
SSDBM
2000
IEEE
168views Database» more  SSDBM 2000»
13 years 11 months ago
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 7 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
WEBI
2010
Springer
13 years 5 months ago
DSP: Robust Semi-supervised Dimensionality Reduction Using Dual Subspace Projections
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
Su Yan, Sofien Bouaziz, Dongwon Lee
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 7 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
13 years 8 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee