Sciweavers

529 search results - page 64 / 106
» Improving verbose queries using subset distribution
Sort
View
SIGIR
2008
ACM
13 years 7 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
SIGMOD
2012
ACM
288views Database» more  SIGMOD 2012»
11 years 10 months ago
Exploiting MapReduce-based similarity joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
Yasin N. Silva, Jason M. Reed
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
13 years 9 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...
AI
2010
Springer
13 years 8 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
IPPS
2007
IEEE
14 years 2 months ago
Replication Strategy in Unstructured Peer-to-Peer Systems
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...
Guofu Feng, Yuquan Jiang, Guihai Chen, Qing Gu, Sa...