232 search results - page 3 / 47 » Fast High-Dimensional Data Search in Incomplete Databases |
STOC
1998
ACM
13 years 10 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
VLDB
2000
ACM
13 years 9 months ago
2000
ACM
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
VLDB
2004
ACM
13 years 11 months ago
2004
ACM
Data cube has been playing an essential role in fast OLAP (online analytical processing) in many multi-dimensional data warehouses. However, there exist data sets in applications ...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
Abstract-- In recent years, data streams have become ubiquitous because of advances in hardware and software technology. The ability to adapt conventional mining problems to data s...
ICDE
2009
IEEE
14 years 17 days ago
2009
IEEE
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...