Sciweavers

516 search results - page 65 / 104
» Retroactive answering of search queries
Sort
View
EDBT
2009
ACM
184views Database» more  EDBT 2009»
16 years 27 days ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
ACL
2010
15 years 4 months ago
Wikipedia as Sense Inventory to Improve Diversity in Web Search Results
Is it possible to use sense inventories to improve Web search results diversity for one word queries? To answer this question, we focus on two broad-coverage lexical resources of ...
Celina Santamaría, Julio Gonzalo, Javier Ar...
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
16 years 7 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
CIKM
2005
Springer
15 years 11 months ago
Novelty detection based on sentence level patterns
The detection of new information in a document stream is an important component of many potential applications. In this paper, a new novelty detection approach based on the identi...
Xiaoyan Li, W. Bruce Croft
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang