2018 search results - page 356 / 404 » Magnitude-preserving ranking algorithms |
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
The classical probabilistic models attempt to capture the Ad hoc information retrieval problem within a rigorous probabilistic framework. It has long been recognized that the prim...
103
click to vote
PODC
2011
ACM
14 years 20 days ago
2011
ACM
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
157
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
111
click to vote
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
WWW
2003
ACM
15 years 10 months ago
2003
ACM
The computation of page importance in a huge dynamic graph has recently attracted a lot of attention because of the web. Page importance, or page rank is defined as the fixpoint o...