Sciweavers

2661 search results - page 58 / 533
» Quantum Complexity Classes
Sort
View
111
Voted
IANDC
2006
102views more  IANDC 2006»
15 years 22 days ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
LOBJET
2000
140views more  LOBJET 2000»
15 years 15 days ago
Early Measures for UML Class Diagrams
:Building software models before implementing them has become widely accepted in the software industry. Object models, graphically represented by class diagrams, lay the foundation...
Marcela Genero, Mario Piattini, Coral Calero
ASIACRYPT
2009
Springer
15 years 7 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
ICPR
2008
IEEE
16 years 1 months ago
Preliminary approach on synthetic data sets generation based on class separability measure
Usually, performance of classifiers is evaluated on real-world problems that mainly belong to public repositories. However, we ignore the inherent properties of these data and how...
Núria Macià, Ester Bernadó-Ma...
99
Voted
TIT
2010
105views Education» more  TIT 2010»
14 years 7 months ago
DMT optimality of LR-aided linear decoders for a general class of channels, lattice designs, and system models
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
Joakim Jalden, Petros Elia