Sciweavers

1578 search results - page 110 / 316
» Algorithmic randomness of continuous functions
Sort
View
ECCC
2010
80views more  ECCC 2010»
14 years 10 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
CORR
2010
Springer
174views Education» more  CORR 2010»
14 years 10 months ago
Hybrid Numerical Solution of the Chemical Master Equation
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...
Thomas A. Henzinger, Maria Mateescu, Linar Mikeev,...
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
14 years 11 months ago
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
Eric Brier, Jean-Sébastien Coron, Thomas Ic...

Book
19360views
16 years 8 months ago
Numerical Recipes in C
C code implementation of several math algorithms such as Linear Algebraic Equations, Interpolation and Extrapolation, Integration of Functions, Evaluation of Functions, Random Num...
William H. Press, Saul A. Teukolsky, William T. Ve...