Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
8,853
A finite word poset
, 2000
"... Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established. Their automorphi ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established
Maximal complexity of finite words
- Pure Math. Appl
, 2002
"... The subword complexity of a finite word w of length N is a function which associates to each n ≤ N the number of all distinct subwords of w having the length n. We define the maximal complexity C(w) as the maximum of the subword complexity for n ∈ {1, 2,..., N}, and the global maximal complexity K(N ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
The subword complexity of a finite word w of length N is a function which associates to each n ≤ N the number of all distinct subwords of w having the length n. We define the maximal complexity C(w) as the maximum of the subword complexity for n ∈ {1, 2,..., N}, and the global maximal complexity K
Properties of palindromes in finite words
- Pure Math. Appl
, 2006
"... We present a method which displays all palindromes of a given length from De Bruijn words of a certain order, and also a recursive one which constructs all palindromes of length n + 1 from the set of palindromes of length n. We show that the palindrome complexity function, which counts the number of ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
in all words of length n. AMS 2000 subject classifications: 68R15 Key words and phrases: finite words, palindromes, palindrome complexity
Finite Word Length Effects on . . .
, 2008
"... Crosstalk interference is the limiting factor in transmission over copper lines. Crosstalk cancelation techniques show great potential for enabling the next leap in DSL transmission rates. An important issue when implementing crosstalk cancelation techniques in hardware is the effect of finite world ..."
Abstract
- Add to MetaCart
world length on performance. In this paper we provide an analysis of the performance of linear zero-forcing precoders, used for crosstalk compensation, in the presence of finite word length errors. We quantify analytically the trade off between precoder word length and transmission rate degradation
PROPERTIES OF THE COMPLEXITY FUNCTION FOR FINITE WORDS
, 2004
"... The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is defined by pw(n) = card(F (w) ∩ A n) for n ∈ N, where F (w) represents the set of all the subwords or factors of w. The shape of the complexity function, especially its piecewise monotonicity, is ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
The subword complexity function pw of a finite word w over a finite alphabet A with cardA = q ≥ 1 is defined by pw(n) = card(F (w) ∩ A n) for n ∈ N, where F (w) represents the set of all the subwords or factors of w. The shape of the complexity function, especially its piecewise monotonicity
On the Relation between Periodicity and Unbordered Factors of Finite Words
, 2008
"... Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equals k. A word is called unbordered if it possesses no proper prefix that is also a suffix of that word. Suppose k < p ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equals k. A word is called unbordered if it possesses no proper prefix that is also a suffix of that word. Suppose k < p
Problem for Finite-Word-length Controller Design
"... : A l control problem is formulated for digital finite-word-length (FWL) controllers with synchronous sampling and fixed-point arithmetic. The l FWL controllers design problem is reduced to the problem of solving a Quadratic Matrix Inequality (QMI) such that the closed-loop system is asymptoticall ..."
Abstract
- Add to MetaCart
: A l control problem is formulated for digital finite-word-length (FWL) controllers with synchronous sampling and fixed-point arithmetic. The l FWL controllers design problem is reduced to the problem of solving a Quadratic Matrix Inequality (QMI) such that the closed-loop system
The Infinite Hidden Markov Model
- Machine Learning
, 2002
"... We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integrate out the infinitely many transition parameters, leaving only three hyperparameters which can be learned from data. Th ..."
Abstract
-
Cited by 637 (41 self)
- Add to MetaCart
. These three hyperparameters define a hierarchical Dirichlet process capable of capturing a rich set of transition dynamics. The three hyperparameters control the time scale of the dynamics, the sparsity of the underlying state-transition matrix, and the expected number of distinct hidden states in a finite
Estimation of probabilities from sparse data for the language model component of a speech recognizer
- IEEE Transactions on Acoustics, Speech and Signal Processing
, 1987
"... Abstract-The description of a novel type of rn-gram language model is given. The model offers, via a nonlinear recursive procedure, a com-putation and space efficient solution to the problem of estimating prob-abilities from sparse data. This solution compares favorably to other proposed methods. Wh ..."
Abstract
-
Cited by 799 (2 self)
- Add to MetaCart
, and it is a problem that one always encounters while collecting fre-quency statistics on words and word sequences (m-grams) from a text of finite size. This means that even for a very large data col-lection, the maximum likelihood estimation method does not allow Turing’s estimate PT for a probability of a
Results 1 - 10
of
8,853
