1716 search results - page 168 / 344 » Proving Conditional Termination |
77
Voted
CORR
2008
Springer
15 years 25 days ago
2008
Springer
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...
CORR
2008
Springer
15 years 24 days ago
2008
Springer
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...
85
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
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...
60
Voted
COMBINATORICS
2007
15 years 22 days ago
2007
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...
108
click to vote
MOR
2008
15 years 20 days ago
2008
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...