Sciweavers

199 search results - page 13 / 40
» Computationally and Algebraically Complex Finite Algebra Mem...
Sort
View
DLT
2004
13 years 10 months ago
Relating Tree Series Transducers and Weighted Tree Automata
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
Andreas Maletti
CDC
2008
IEEE
108views Control Systems» more  CDC 2008»
14 years 3 months ago
On the state-space design of optimal controllers for distributed systems with finite communication speed
— We consider the problem of designing optimal distributed controllers whose impulse response has limited propagation speed. We introduce a state-space framework in which such co...
Makan Fardad, Mihailo R. Jovanovic
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
14 years 1 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
CCS
2006
ACM
14 years 10 days ago
Beyond separation of duty: an algebra for specifying high-level security policies
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...
Ninghui Li, Qihua Wang
IPPS
2008
IEEE
14 years 3 months ago
Build to order linear algebra kernels
—The performance bottleneck for many scientific applications is the cost of memory access inside linear algebra kernels. Tuning such kernels for memory efficiency is a complex ...
Jeremy G. Siek, Ian Karlin, Elizabeth R. Jessup