Sciweavers

468 search results - page 41 / 94
» One-Way Functions in Complexity Theory
Sort
View
CORR
2008
Springer
72views Education» more  CORR 2008»
15 years 4 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik
DEDS
2008
108views more  DEDS 2008»
15 years 4 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 7 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
14 years 7 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
16 years 4 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson