5115 search results - page 736 / 1023 » On Randomized Lanczos Algorithms |
216
click to vote
IEEESCC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
152
click to vote
ALGORITHMS
2010
15 years 4 months ago
2010
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
204
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
226
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
201
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...