Sciweavers

230 search results - page 14 / 46
» Data Structures for Restricted Triangular Range Searching
Sort
View
SIGMOD
1999
ACM
112views Database» more  SIGMOD 1999»
15 years 1 months ago
A New Method for Similarity Indexing of Market Basket Data
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu
75
Voted
WWW
2009
ACM
15 years 10 months ago
Dataplorer: a scalable search engine for the data web
More and more structured information in the form of semantic data is nowadays available. It offers a wide range of new possibilities especially for semantic search and Web data in...
Haofen Wang, Qiaoling Liu, Gui-Rong Xue, Yong Yu, ...
94
Voted
PVLDB
2010
252views more  PVLDB 2010»
14 years 4 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
GIR
2006
ACM
15 years 3 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
FOCS
1992
IEEE
15 years 1 months ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...