Sciweavers

128 search results - page 13 / 26
» Comparing top k lists
Sort
View
EDBT
2009
ACM
145views Database» more  EDBT 2009»
13 years 11 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
WINE
2009
Springer
199views Economy» more  WINE 2009»
14 years 2 months ago
Externalities in Keyword Auctions: An Empirical and Theoretical Assessment
It is widely believed that the value of acquiring a slot in a sponsored search list (that comes along with the organic links in a search engine’s result page) highly depends on ...
Renato Gomes, Nicole Immorlica, Evangelos Markakis
SIGIR
2008
ACM
13 years 7 months ago
Discriminative probabilistic models for passage based retrieval
The approach of using passage-level evidence for document retrieval has shown mixed results when it is applied to a variety of test beds with different characteristics. One main r...
Mengqiu Wang, Luo Si
CIKM
2010
Springer
13 years 6 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang
CCGRID
2006
IEEE
14 years 1 months ago
Scalable Approaches for Supporting MPI-IO Atomicity
Scalable atomic and parallel access to noncontiguous regions of a file is essential to exploit high performance I/O as required by large-scale applications. Parallel I/O framewor...
Peter M. Aarestad, Avery Ching, George K. Thiruvat...