2018 search results - page 294 / 404 » Magnitude-preserving ranking algorithms |
175
Voted
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Given the continuous growth of databases and the abundance of diverse files in modern IT environments, there is a pressing need to integrate keyword search on heterogeneous inform...
178
click to vote
SIGMOD
2010
ACM
15 years 25 days ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
191
Voted
COCO
2011
Springer
14 years 5 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
213
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
188
click to vote
SIGIR
2012
ACM
13 years 8 months ago
2012
ACM
In this paper, we tackle the problem of top-N context-aware recommendation for implicit feedback scenarios. We frame this challenge as a ranking problem in collaborative filterin...