1578 search results - page 49 / 316 » Algorithmic randomness of continuous functions |
IJCNN
2000
IEEE
14 years 3 months ago
2000
IEEE
Many machine learning algorithms can be formulated as the minimization of a training criterion which involves (1) \training errors" on each training example and (2) some hype...
COCO
2003
Springer
14 years 4 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
COCO
2009
Springer
14 years 5 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
DAC
2004
ACM
14 years 2 months ago
2004
ACM
Random test generators are often used to create regression suites on-the-fly. Regression suites are commonly generated by choosing several specifications and generating a number o...
ICIC
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal qu...