5115 search results - page 604 / 1023 » On Randomized Lanczos Algorithms |
143
click to vote
FOCS
2009
IEEE
16 years 1 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
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Self-organising multi-agent systems provide a suitable paradigm for developing autonomic computing systems that manage themselves. Towards this goal, we demonstrate a robust, dece...
220
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
158
click to vote
RECSYS
2009
ACM
16 years 1 months ago
2009
ACM
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative ï¬...
191
click to vote
SIGIR
2009
ACM
16 years 1 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...