468 search results - page 21 / 94 » One-Way Functions in Complexity Theory |
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
FLAIRS
2003
15 years 11 days ago
2003
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...
TPHOL
2002
IEEE
15 years 3 months ago
2002
IEEE
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
ILP
2004
Springer
15 years 4 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
JUCS
2008
14 years 11 months ago
2008
: Given a probability measure and a positive integer n. How to choose n knots and n weights such that the corresponding quadrature rule has the minimum worst-case error when appli...