Sciweavers

1355 search results - page 33 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
AAAI
2012
11 years 10 months ago
A Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
Michael Chiang, David Poole
ACRI
2004
Springer
14 years 1 months ago
Replication of Spatio-temporal Land Use Patterns at Three Levels of Aggregation by an Urban Cellular Automata
The SLEUTH urban growth model [1] is a cellular automata model that has been widely applied throughout the geographic literature to examine the historic settlement patterns of citi...
Charles Dietzel, Keith C. Clarke
DLT
2008
13 years 9 months ago
The Average State Complexity of the Star of a Finite Set of Words Is Linear
We prove that, for the uniform distribution over all sets X of m (that is a fixed integer) non-empty words whose sum of lengths is n, DX , one of the usual deterministic automata r...
Frédérique Bassino, Laura Giambruno,...
DLT
2008
13 years 8 months ago
On the Size Complexity of Rotating and Sweeping Automata
We examine the succinctness of one-way, rotating, sweeping, and two-way deterministic finite automata (1dfas, rdfas, sdfas, 2dfas). Here, a sdfa is a 2dfa whose head can change di...
Christos A. Kapoutsis, Richard Královic, To...
ICDE
2008
IEEE
123views Database» more  ICDE 2008»
14 years 9 months ago
Handling Non-linear Polynomial Queries over Dynamic Data
Applications that monitor functions over rapidly and unpredictably changing data, express their needs as continuous queries. Our focus is on a rich class of queries, expressed as p...
Shetal Shah, Krithi Ramamritham