Sciweavers

733 search results - page 98 / 147
» Recommending random walks
Sort
View
NIPS
2003
14 years 11 months ago
Ranking on Data Manifolds
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....
Dengyong Zhou, Jason Weston, Arthur Gretton, Olivi...
TREC
2007
14 years 11 months ago
University of Twente at the TREC 2007 Enterprise Track: Modeling Relevance Propagation for the Expert Search Task
This paper describes several approaches which we used for the expert search task of the TREC 2007 Enterprise track. We studied several methods of relevance propagation from docume...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 9 months ago
Local Information Based Algorithms for Packet Transport in Complex Networks
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
Bernard Kujawski, G. J. Rodgers, Bosiljka Tadic
JSAT
2008
85views more  JSAT 2008»
14 years 9 months ago
Parallel SAT Solving using Bit-level Operations
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...
Marijn Heule, Hans van Maaren
LMCS
2006
87views more  LMCS 2006»
14 years 9 months ago
Model Checking Probabilistic Pushdown Automata
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...
Antonín Kucera, Javier Esparza, Richard May...