1541 search results - page 107 / 309 » Analysis of Random Noise and Random Walk Algorithms |
164
Voted
COLT
1991
Springer
15 years 8 months ago
1991
Springer
Abstract. This paper presents a polynomial-time algorithm for inferring a probabilistic generalization of the class of read-once Boolean formulas over the usual basis {AND,OR,NOT}....
136
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
116
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
148
click to vote
SIGIR
2009
ACM
15 years 11 months ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
163
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...