Sciweavers

403 search results - page 81 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
13 years 11 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 5 months ago
New Results on Quantum Property Testing
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
JCSS
2008
138views more  JCSS 2008»
13 years 5 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...