Sciweavers

4372 search results - page 360 / 875
» Algorithmic Theories of Everything
Sort
View
DLT
2009
15 years 4 months ago
Weighted versus Probabilistic Logics
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
Benedikt Bollig, Paul Gastin
ICASSP
2009
IEEE
15 years 4 months ago
Distributed sampling and reconstruction of non-bandlimited fields in sensor networks based on shift-invariant spaces
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
Gunter Reise, Gerald Matz
COGSCI
2011
49views more  COGSCI 2011»
15 years 1 months ago
What a Rational Parser Would Do
This article examines cognitive process models of human sentence comprehension based on the idea of informed search. These models are rational in the sense that they strive to qui...
John T. Hale
CDC
2010
IEEE
123views Control Systems» more  CDC 2010»
15 years 1 months ago
Causal observability of nonlinear time-delay systems with unknown inputs
This paper investigates the problem of causal observability of the states and unknown inputs of nonlinear time-delay systems. Using the theory of non-commutative rings, the nonline...
Gang Zheng, Jean-Pierre Barbot, Driss Boutat, Thie...
IJNSEC
2010
105views more  IJNSEC 2010»
15 years 1 months ago
A Note on the Constructions of Orthomorphic Permutations
Orthomorphic permutations have important applications in the design of block ciphers. A practical algorithm is derived to generate all orthomorphic permutations over Fm 2 , and it...
Jianqin Zhou