Sciweavers

2001 search results - page 383 / 401
» Indexing in a Hypertext Database
Sort
View
BTW
2007
Springer
183views Database» more  BTW 2007»
13 years 11 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
SIGIR
2010
ACM
13 years 11 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
EDBT
2009
ACM
156views Database» more  EDBT 2009»
13 years 11 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
CAISE
2006
Springer
13 years 11 months ago
Bridging the Gap between Data Warehouses and Organizations
Abstract. Data Warehouse (DWH) systems are used by decision makers for performance measurement and decision support. Currently the main focus of the DWH research field is not as mu...
Veronika Stefanov
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang