2661 search results - page 307 / 533 » Quantum Complexity Classes |
117
click to vote
ICANN
2003
Springer
15 years 9 months ago
2003
Springer
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
129
Voted
PODS
2010
ACM
15 years 9 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
144
click to vote
IEEEPACT
2002
IEEE
15 years 8 months ago
2002
IEEE
Clustering is an effective microarchitectural technique for reducing the impact of wire delays, the complexity, and the power requirements of microprocessors. In this work, we inv...
154
Voted
STOC
2010
ACM
15 years 8 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
135
Voted
ICAISC
2010
Springer
15 years 8 months ago
2010
Springer
In the paper we recover a Hammerstein system nonlinearity. Hammerstein systems, incorporating nonlinearity and dynamics, play an important role in various applications, and e¤ecti...