1804 search results - page 102 / 361 » Ranking for data repairs |
225
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
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...
160
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
141
click to vote
INEX
2007
Springer
15 years 10 months ago
2007
Springer
This paper describes the participation of the INRIA group in the INEX 2007 XML entity ranking and ad hoc tracks. We developed a system for ranking Wikipedia entities in answer to a...
126
click to vote
SIGIR
2006
ACM
15 years 10 months ago
2006
ACM
We show that incorporating user behavior data can significantly improve ordering of top results in real web search setting. We examine alternatives for incorporating feedback into...
142
Voted
EUROCRYPT
2004
Springer
15 years 10 months ago
2004
Springer
Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the kth -ranked element of the union of the datasets, e.g. the med...