Results 1  10
of
92
Let A be a nite alphabet, jAj =: n, and suppose strings
"... Abstract. This paper analyzes the expected performance of a simplied version BM 0 of the Boyer{Moore string matching algorithm. A probabilistic automaton A is set up which models the expected behavior of BM 0 under the assumption that both text and pattern are generated by a source which emits indep ..."
Abstract
 Add to MetaCart
and the alphabet's probabilistic properties. Finally, empirical evidence is provided which is in satisfactory accordance with the theory.
Parallel deflation with alphabetbased criteria for blind source extraction
 In IEEE SSP’05
"... Blind source extraction aims at estimating the source signals which appear mixed at the output of a sensor array. A novel approach to blind source extraction is presented in this contribution, which exploits the discrete character (finite alphabet property) of digital modulations in the case where ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Blind source extraction aims at estimating the source signals which appear mixed at the output of a sensor array. A novel approach to blind source extraction is presented in this contribution, which exploits the discrete character (finite alphabet property) of digital modulations in the case where
Rényi's Divergence and Entropy Rates for Finite Alphabet Markov Sources
"... In this work, we examine the existence and the computation of the Renyi divergence rate, lim n!1 1 n D (p (n) kq (n) ), between two timeinvariant nitealphabet Markov sources of arbitrary order and arbitrary initial distributions described by the probability distributions p (n) and q (n) ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
In this work, we examine the existence and the computation of the Renyi divergence rate, lim n!1 1 n D (p (n) kq (n) ), between two timeinvariant nitealphabet Markov sources of arbitrary order and arbitrary initial distributions described by the probability distributions p (n) and q (n
Prediction and Dimension
 Journal of Computer and System Sciences
, 2002
"... Given a set X of sequences over a nite alphabet, we investigate the following three quantities. (i) The feasible predictability of X is the highest success ratio that a polynomialtime randomized predictor can achieve on all sequences in X. ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Given a set X of sequences over a nite alphabet, we investigate the following three quantities. (i) The feasible predictability of X is the highest success ratio that a polynomialtime randomized predictor can achieve on all sequences in X.
Hierarchical Structures in Sturmian Dynamical Systems
"... The paper is concerned with hierarchical structures in subshifts over a nite alphabet. In particular, we present a hierarchy based approach to Sturmian systems. This approach is then used to characterize the linearly repetitive Sturmian systems (among the Sturmian systems) by uniform positivity ..."
Abstract

Cited by 14 (13 self)
 Add to MetaCart
The paper is concerned with hierarchical structures in subshifts over a nite alphabet. In particular, we present a hierarchy based approach to Sturmian systems. This approach is then used to characterize the linearly repetitive Sturmian systems (among the Sturmian systems) by uniform positivity
BLIND EQUALIZATION IN PRESENCE OF BOUNDED ERRORS
"... This communication presents a new approach to blind equalization of a FIR channel. It is based on a boundederror assumption and takes into account the fact that the input signal is in a nite alphabet. We show that even in the noisy case, identiability can be guaranteed in nite time, provided that t ..."
Abstract
 Add to MetaCart
This communication presents a new approach to blind equalization of a FIR channel. It is based on a boundederror assumption and takes into account the fact that the input signal is in a nite alphabet. We show that even in the noisy case, identiability can be guaranteed in nite time, provided
Substitution Dynamical Systems: Characterization Of Linear Repetitivity And Applications
"... We consider dynamical systems arising from substitutions over a nite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive substitutions to minimal substitutions. This includes application ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We consider dynamical systems arising from substitutions over a nite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive substitutions to minimal substitutions. This includes
Equilibria in repeated games of incomplete information: The general symmetric case
 INT J GAME THEORY (1998) 27:201210
, 1998
"... Every two person repeated game of symmetric incomplete information, in which the signals sent at each stage to both players are identical and generated by a state and moves dependent probability distribution on a given ®nite alphabet, has an equilibrium payoff. ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Every two person repeated game of symmetric incomplete information, in which the signals sent at each stage to both players are identical and generated by a state and moves dependent probability distribution on a given ®nite alphabet, has an equilibrium payoff.
Ordering Memoryless Source Alphabets Using Competitive Lists
"... The term competitive list is proposed as a more descrip# tive name for a device previously called a #selforganising sequential list using the transposition heuristic#. The use of a competitive list on the output of a discrete memory# less source is investigated. The steadystate probabilities of th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
List A competitive list is a device that receives a semiin#nite sequence of symbols X#1#;X#2#;X#3#;::: from an Nary source, and transforms it into a new semiin#nite sequence of symbols R#1#;R#2#;R#3#;:::over the alphabet of integers f1; 2;:::;Ng. The purpose of this paper is to investigate
Results 1  10
of
92