4666 search results - page 353 / 934 » Equations on Timed Languages |
205
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents an algorithm for an 1-regularized Kalman filter. Given observations of a discrete-time linear dynamical system with sparse errors in the state evolution, we e...
172
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Parallel computation of the adaptive lattice filtering algorithm is difficult due to the dependency problem caused by feedback operations. The conventional control-level paralle...
183
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
174
click to vote
ISOLA
2010
Springer
15 years 5 months ago
2010
Springer
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
332
click to vote
POPL
2001
ACM
16 years 7 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...