How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Graph-centric and node-centric browsing are the two commonly identified hypertext-browsing paradigms. We believe that pathcentric browsing, the browsing behavior exhibited by path...
Pratik Dave, Unmil Karadkar, Richard Furuta, Luis ...
: Large information bases that are used by several different users and applications accommodate the demands of their users more effectively, if they can be split into possibly over...
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
Choon Hui Teo, S. V. N. Vishwanathan, Alex J. Smol...
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...