Sciweavers

205 search results - page 19 / 41
» Combinatorics of sequential dynamical systems
Sort
View
UC
2005
Springer
14 years 26 days ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
13 years 8 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...
CORR
2011
Springer
149views Education» more  CORR 2011»
13 years 2 months ago
General Iteration graphs and Boolean automata circuits
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...
Mathilde Noual
ACL
2003
13 years 8 months ago
An Adaptive Approach to Collecting Multimodal Input
Multimodal dialogue systems allow users to input information in multiple modalities. These systems can handle simultaneous or sequential composite multimodal input. Different coor...
Anurag Gupta
CC
2009
Springer
149views System Software» more  CC 2009»
14 years 8 months ago
Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction
Speculative parallelisation represents a promising solution to speed up sequential programs that are hard to parallelise otherwise. Prior research has focused mainly on parallelisi...
Lin Gao 0002, Lian Li 0002, Jingling Xue, Tin-Fook...