5115 search results - page 82 / 1023 » On Randomized Lanczos Algorithms |
130
Voted
CCA
2009
Springer
15 years 9 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
104
click to vote
PODC
2009
ACM
16 years 3 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
98
Voted
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized contex...
121
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
126
Voted
AAAI
2011
14 years 2 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...