2356 search results - page 237 / 472 » Characterizations of postman sets |
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of information embedding where the encoder modifies a white Gaussian host signal in a power-constrained manner to encode the message, and the decoder recov...
127
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The extensive research and development of micromechanical resonators is trying to allow the use of these devices for highly sensitive applications. Microcantilevers are some of th...
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the discrete, time-varying broadcast channel with memory, under the assumption that the channel states belong to a set of nite cardinality. We begin with the de nition...
160
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
182
click to vote
ENTCS
2010
15 years 6 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...