Sciweavers

6393 search results - page 374 / 1279
» Randomized Algorithms on the Mesh
Sort
View
SIAMIS
2010
378views more  SIAMIS 2010»
15 years 1 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
158
Voted
ECCC
2010
103views more  ECCC 2010»
15 years 6 months ago
Time-Space Efficient Simulations of Quantum Computations
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
Dieter van Melkebeek, Thomas Watson
CORR
2000
Springer
100views Education» more  CORR 2000»
15 years 6 months ago
Perfect simulation from the Quicksort limit distribution
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...
Luc Devroye, James Allen Fill, Ralph Neininger
IPL
2000
146views more  IPL 2000»
15 years 6 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 10 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali