Sciweavers

11716 search results - page 185 / 2344
» Computable symbolic dynamics
Sort
View
CAV
2001
Springer
83views Hardware» more  CAV 2001»
15 years 11 months ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen
DCC
2000
IEEE
15 years 11 months ago
Iterative Source/Channel-Decoding Using Reversible Variable Length Codes
In this paper we describe a trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding o...
Rainer Bauer, Joachim Hagenauer
WCNC
2010
IEEE
15 years 10 months ago
Interference Analysis in Time and Frequency Asynchronous Network MIMO OFDM Systems
—It is well known that symbol timing offsets larger than the cyclic prefix as well as carrier frequency offsets between transmitter and receiver stations destroy the orthogonali...
Vincent Kotzsch, Gerhard Fettweis
ICMLA
2004
15 years 8 months ago
Emergent representations and reasoning in adaptive agents
Classically, cognition assumes that the underlying mechanisms of thinking are based on symbol manipulation processes. This assumption has several drawbacks, such as the issue of w...
Joost Broekens, Doug DeGroot
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 6 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...