Sciweavers

45 search results - page 6 / 9
» A fast all nearest neighbor algorithm for applications invol...
Sort
View
SIGMOD
2003
ACM
125views Database» more  SIGMOD 2003»
14 years 7 months ago
An Optimal and Progressive Algorithm for Skyline Queries
The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerabl...
Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Se...
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
ICDM
2007
IEEE
147views Data Mining» more  ICDM 2007»
14 years 1 months ago
Scalable Collaborative Filtering with Jointly Derived Neighborhood Interpolation Weights
Recommender systems based on collaborative filtering predict user preferences for products or services by learning past user-item relationships. A predominant approach to collabo...
Robert M. Bell, Yehuda Koren
GIS
2005
ACM
14 years 8 months ago
Improving the R*-tree with outlier handling techniques
The R*-tree, as a state-of-the-art spatial index, has already found its way into commercial systems like Oracle. In this paper, we aim at improving query performance of the R*tree...
Tian Xia, Donghui Zhang
VLDB
1999
ACM
118views Database» more  VLDB 1999»
13 years 11 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani