5608 search results - page 1095 / 1122 » On the Theory of Matchgate Computations |
145
click to vote
COLT
1993
Springer
15 years 5 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
195
click to vote
STOC
1993
ACM
15 years 5 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
107
click to vote
CTRS
1990
15 years 5 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
124
click to vote
FPCA
1989
15 years 5 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
119
click to vote
ACMICEC
2007
ACM
15 years 5 months ago
2007
ACM
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...