182 search results - page 20 / 37 » A Theory of Strict P-completeness |
TCOM
2010
13 years 6 months ago
2010
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
EMSOFT
2010
Springer
13 years 5 months ago
2010
Springer
Many safety-critical embedded systems are subject to certification requirements. However, only a subset of the functionality of the system may be safety-critical and hence subject...
AI
2011
Springer
13 years 2 months ago
2011
Springer
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
TCIAIG
2010
13 years 2 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
ICA
2012
Springer
12 years 3 months ago
2012
Springer
Independent component analysis (ICA) is possibly the most widespread approach to solve the blind source separation (BSS) problem. Many different algorithms have been proposed, tog...