5115 search results - page 360 / 1023 » On Randomized Lanczos Algorithms |
208
click to vote
AAAI
2008
15 years 9 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
202
click to vote
NIPS
2004
15 years 8 months ago
2004
In the context of binary classification, we define disagreement as a measure of how often two independently-trained models differ in their classification of unlabeled data. We exp...
227
click to vote
UAI
2004
15 years 8 months ago
2004
Bayesian learning in undirected graphical models--computing posterior distributions over parameters and predictive quantities-is exceptionally difficult. We conjecture that for ge...
202
Voted
NN
2000
Springer
15 years 7 months ago
2000
Springer
A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons...
183
click to vote
ICDT
1999
ACM
15 years 11 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...