Sciweavers

4403 search results - page 720 / 881
» Galois Theory of Algorithms
Sort
View
209
Voted
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
15 years 7 months ago
Probabilistic performance of state estimation across a lossy network
We consider a discrete time state estimation problem over a packet-based network. In each discrete time step, a measurement packet is sent across a lossy network to an estimator u...
Michael Epstein, Ling Shi, Abhishek Tiwari, Richar...
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 7 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
AUTOMATICA
2008
154views more  AUTOMATICA 2008»
15 years 7 months ago
Approximately bisimilar symbolic models for nonlinear control systems
Control systems are usually modeled by differential equations describing how physical phenomena can be influenced by certain control parameters or inputs. Although these models ar...
Giordano Pola, Antoine Girard, Paulo Tabuada
CGF
2008
137views more  CGF 2008»
15 years 7 months ago
Exploiting Visibility Correlation in Direct Illumination
The visibility function in direct illumination describes the binary visibility over a light source, e.g., an environment map. Intuitively, the visibility is often strongly correla...
Petrik Clarberg, Tomas Akenine-Möller
CORR
2010
Springer
121views Education» more  CORR 2010»
15 years 7 months ago
Asynchronous Bounded Expected Delay Networks
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...