Results 1  10
of
1,660,260
Variable Length Markov Chains
 Annals of Statistics
, 1999
"... We study estimation in the class of stationary variable length Markov chains (VLMC) on a finite space. The processes in this class are still Markovian of higher order, but with memory of variable length yielding a much bigger and structurally richer class of models than ordinary higher order Markov ..."
Abstract

Cited by 131 (5 self)
 Add to MetaCart
We study estimation in the class of stationary variable length Markov chains (VLMC) on a finite space. The processes in this class are still Markovian of higher order, but with memory of variable length yielding a much bigger and structurally richer class of models than ordinary higher order Markov
The synchronization of variablelength codes
 IEEE Trans. Inf. Theory
, 1997
"... Abstract—Many variablelength codes exhibit a tendency for resynchronization to occur automatically following any error. However, attempts to identify an underlying synchronization mechanism, and to accurately predict the expected synchronization delay (ESD), for even quite specific variablelength ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Abstract—Many variablelength codes exhibit a tendency for resynchronization to occur automatically following any error. However, attempts to identify an underlying synchronization mechanism, and to accurately predict the expected synchronization delay (ESD), for even quite specific variablelength
VariableLength Maximal Codes
"... Abstract. In this survey, we present some of the main open problems in the theory of variablelength codes, together with the major advancements recently realized to solve them. ..."
Abstract
 Add to MetaCart
Abstract. In this survey, we present some of the main open problems in the theory of variablelength codes, together with the major advancements recently realized to solve them.
Clustering Variable Length Sequences by
 In Lecture Notes in Computer Science
, 2004
"... We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable length sequences without requiring normalization of data. We show that the number of clusters governs the number of eige ..."
Abstract
 Add to MetaCart
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable length sequences without requiring normalization of data. We show that the number of clusters governs the number
STABILIZATION OF THE VARIABLELENGTH PENDULUM
"... The variablelength pendulum, proved to be nonminimum phase and non staticstatefeedback linearizable, is stabilized around an equilibrium point by means of the passivitybased design control technique of Energy Shaping plus Damping Injection 1 ..."
Abstract
 Add to MetaCart
The variablelength pendulum, proved to be nonminimum phase and non staticstatefeedback linearizable, is stabilized around an equilibrium point by means of the passivitybased design control technique of Energy Shaping plus Damping Injection 1
Complete VariableLength . . .
, 1994
"... A set of codewords is fixfree if it is both prefixfree and suffixfree: no codeword in the set is a prefix or a suffix of any other. A set of codewords fx 1 �x 2 �:::�xng over a tletter alphabet is said to be complete if it satisfies the Kraft inequality with equality, so that X 1 i n t;jxij =1: ..."
Abstract
 Add to MetaCart
: The set k of all codewords of length k is obviously both fixfree and complete. We show, surprisingly, that there are other examples of complete fixfree codes, ones whose codewords have a variety of lengths. We discuss such variablelength (complete) fixfree codes and techniques for constructing them.
Variablelength convolution . . .
, 2014
"... This paper presents a variablelength decisionfeedback scheme that uses tailbiting convolutional codes and the tailbiting ReliabilityOutput Viterbi Algoritm (ROVA). Comparing with recent results in finiteblocklength information theory, simulation results for both the BSC and the AWGN channel sh ..."
Abstract
 Add to MetaCart
This paper presents a variablelength decisionfeedback scheme that uses tailbiting convolutional codes and the tailbiting ReliabilityOutput Viterbi Algoritm (ROVA). Comparing with recent results in finiteblocklength information theory, simulation results for both the BSC and the AWGN channel
Variablelength extractors
 in Proc. IEEE International Symposium on Information Theory (ISIT
, 2012
"... Abstract—The topic of generating random bits from imperfect random sources was studied extensively. Existing work provides solutions that are based on the concept of a fixedlength extractor; namely, an algorithm that gets a fixed number of random bits from a source and generates random bits. Typica ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
consider a scenario where the source is a weak stochastic process and the output sequence is required to be ϵclose to the uniform distribution on {0, 1} m, where m is a prescribed value. We introduce a new class of extractors with a variable inputlength and fixed outputlength. Our variablelength
Variable Length Genomes for Evolutionary Algorithms
 In Proceedings of the Genetic and Evolutionary Computation Conference, 806. Las Vegas
, 2000
"... A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects of exG are discussed and preliminary results of exG usage are presented. The generality of this variable legnth genome is ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects of exG are discussed and preliminary results of exG usage are presented. The generality of this variable legnth genome
Results 1  10
of
1,660,260