Sciweavers

5329 search results - page 708 / 1066
» The Weighted Majority Algorithm
Sort
View
394
Voted
SAC
2011
ACM
14 years 10 months ago
Parallel multivariate slice sampling
Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...
Matthew M. Tibbits, Murali Haran, John C. Liechty
ALT
2011
Springer
14 years 7 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
CEC
2011
IEEE
14 years 7 months ago
Comparing alternative energy functions for the HP model of protein structure prediction
Abstract—Protein structure prediction is the problem of finding the functional conformation of a protein given only its amino uence. The HP lattice model is an abstract formulat...
Mario Garza-Fabre, Eduardo Rodriguez-Tello, Gregor...
238
Voted
INFOCOM
2012
IEEE
13 years 10 months ago
Harnessing Internet topological stability in Thorup-Zwick compact routing
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
Stephen D. Strowes, Colin Perkins
263
Voted
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 10 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák