5153 search results - page 131 / 1031 » Introduction to Randomized Algorithms |
142
click to vote
PAMI
2008
15 years 2 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....
125
click to vote
CORR
2011
Springer
14 years 9 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...
114
click to vote
ENTCS
2007
15 years 2 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 ...
174
Voted
STACS
2012
Springer
13 years 10 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...
138
Voted
WWW
2004
ACM
16 years 3 months ago
2004
ACM
The paper describes some innovations related to the ongoing work on the GSA prototype, an integrated information retrieval agent. In order to improve the original system effective...