Sciweavers

1716 search results - page 168 / 344
» Proving Conditional Termination
Sort
View
CORR
2008
Springer
92views Education» more  CORR 2008»
15 years 3 months ago
A connection between palindromic and factor complexity using return words
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
Michelangelo Bucci, Alessandro De Luca, Amy Glen, ...
CORR
2008
Springer
120views Education» more  CORR 2008»
15 years 3 months ago
Codeword-Independent Performance of Nonbinary Linear Codes Under Linear-Programming and Sum-Product Decoding
A coded modulation system is considered in which nonbinary coded symbols are mapped directly to nonbinary modulation signals. It is proved that if the modulator-channel combination...
Mark F. Flanagan
CORR
2008
Springer
70views Education» more  CORR 2008»
15 years 3 months ago
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes
This paper deals with the problem of universal lossless coding on a countable infinite alphabet. It focuses on some classes of sources defined by an envelope condition on the margi...
Dominique Bontemps
COMBINATORICS
2007
66views more  COMBINATORICS 2007»
15 years 3 months ago
The Tripartite Separability of Density Matrices of Graphs
The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed dens...
Zhen Wang, Zhixi Wang
MOR
2008
81views more  MOR 2008»
15 years 3 months ago
Optimal Stopping of Linear Diffusions with Random Discounting
Abstract. We propose a new solution method for optimal stopping problems with random discounting for linear diffusions whose state space has a combination of natural, absorbing, or...
Savas Dayanik