215 search results - page 6 / 43 » The asymptotic number of binary codes and binary matroids |
TIT
2002
14 years 9 months ago
2002
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
MLQ
2010
14 years 8 months ago
2010
We consider logical expressions built on the single binary connector of implication and a finite number of literals (boolean variables and their negations). We prove that asympto...
COMBINATORICS
2006
14 years 9 months ago
2006
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compos...
ESEM
2008
ACM
14 years 11 months ago
2008
ACM
Code churn, the amount of code change taking place within a software unit over time, has been correlated with fault-proneness in software systems. We investigate the use of code c...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...