2661 search results - page 218 / 533 » Quantum Complexity Classes |
136
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
133
Voted
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—Multi-input multi-output (MIMO) receivers have been designed and their communication performance analyzed under the assumption of additive Gaussian noise. Wireless transceivers,...
142
Voted
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
125
Voted
FROCOS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
118
Voted
MICAI
2007
Springer
15 years 9 months ago
2007
Springer
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...