5115 search results - page 654 / 1023 » On Randomized Lanczos Algorithms |
171
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
276
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Belief propagation (BP) is an effective algorithm for solving energy minimization problems in computer vision. However, it requires enormous memory, bandwidth, and computation beca...
192
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
196
click to vote
APPROX
2007
Springer
16 years 24 days ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
211
click to vote
TACAS
2007
Springer
16 years 22 days ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...