5608 search results - page 931 / 1122 » On the Theory of Matchgate Computations |
115
Voted
COLT
1994
Springer
15 years 6 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
105
click to vote
ECML
1993
Springer
15 years 6 months ago
1993
Springer
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
SP
1989
IEEE
15 years 5 months ago
1989
IEEE
Everyone who has seen the movie Wall Street will have seen a commercial security policy in action. The recent work of Clark and Wilson and the WIPCIS initiative (the Workshop on I...
118
Voted
COLT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
106
Voted
COMPGEOM
2007
ACM
15 years 5 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...