1128 search results - page 71 / 226 » Classical Natural Deduction |
ICASSP
2009
IEEE
14 years 4 months ago
2009
IEEE
In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for...
CCA
2009
Springer
14 years 4 months ago
2009
Springer
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...
CIE
2009
Springer
14 years 4 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
MFCS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We investigate the structure of the set of gapped motifs (repeated patterns with don’t cares) of a given string of symbols. A natural equivalence classification is int...
CIE
2005
Springer
14 years 3 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...