5115 search results - page 124 / 1023 » On Randomized Lanczos Algorithms |
189
click to vote
PAMI
2008
15 years 6 months ago
2008
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
173
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
155
click to vote
ENTCS
2007
15 years 6 months ago
2007
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
228
click to vote
STACS
2012
Springer
14 years 1 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
283
click to vote
POPL
2005
ACM
16 years 6 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...