Sciweavers

3229 search results - page 246 / 646
» The Theory of Timed Automata
Sort
View
UAI
2003
15 years 8 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
16 years 7 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
ICC
2007
IEEE
149views Communications» more  ICC 2007»
16 years 29 days ago
Synchronization Signal Design for OFDM Based On Time-Frequency Hopping Patterns
— In an OFDM system, channel estimation can be considered as sampling the time-frequency response of the channel through a number of known pilot symbols placed across the time-fr...
Jiann-Ching Guey
COGSCI
2010
104views more  COGSCI 2010»
15 years 6 months ago
Space and Time in the Child's Mind: Evidence for a Cross-Dimensional Asymmetry
What is the relationship between space and time in the human mind? Studies in adults show an asymmetric relationship between mental representations of these basic dimensions of ex...
Daniel Casasanto, Olga Fotakopoulou, Lera Borodits...
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 7 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...