Sciweavers

4377 search results - page 399 / 876
» Mass problems and randomness
Sort
View
WWW
2005
ACM
16 years 7 months ago
BackRank: an alternative for PageRank?
This paper proposes to extend a previous work, The Effect of the Back Button in a Random Walk: Application for PageRank [5]. We introduce an enhanced version of the PageRank algor...
Mohamed Bouklit, Fabien Mathieu
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
16 years 7 months ago
On maximizing welfare when utility functions are subadditive
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
Uriel Feige
ALT
2007
Springer
16 years 3 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
FOCS
2009
IEEE
16 years 1 months ago
KKL, Kruskal-Katona, and Monotone Nets
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...
Ryan O'Donnell, Karl Wimmer
SIGIR
2009
ACM
16 years 1 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...