288 search results - page 20 / 58 » Document generality: its computation for ranking |
73
Voted
SIGIR
2010
ACM
15 years 1 months ago
2010
ACM
This paper presents a new way of thinking for IR metric optimization. It is argued that the optimal ranking problem should be factorized into two distinct yet interrelated stages:...
65
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
107
click to vote
WWW
2005
ACM
15 years 3 months ago
2005
ACM
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
89
Voted
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
Process variations in modern VLSI technologies are growing in both magnitude and dimensionality. To assess performance variability, complex simulation and performance models param...
67
Voted
CHI
1993
ACM
15 years 1 months ago
1993
ACM
As the ease of accessing and generating large quantities of information increases, people’s ability to navigate through that information and maintain personal perspective decrea...