Sciweavers

4403 search results - page 359 / 881
» Galois Theory of Algorithms
Sort
View
GLOBECOM
2010
IEEE
15 years 4 months ago
Information Theoretic Optimal Broadband Matching for Communication Systems
We present an information theoretic perspective on optimal broadband matching. Most of the broadband matching and communication theory literature assumes a frequencyflat reflection...
Pawandeep S. Taluja, Brian L. Hughes
SIGDIAL
2010
15 years 4 months ago
Presupposition Accommodation as Exception Handling
Van der Sandt's algorithm for handling presupposition is based on a "presupposition as anaphora" paradigm and is expressed in the realm of Kamp's DRT. In recen...
Philippe de Groote, Ekaterina Lebedeva
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