 |
|
|
|
 Approximate Kalman Filtering (Approximations and Decompositions)
Kalman filtering algorithm gives optimal (linear, unbiased and minimum error-variance) estimates of the unknown state vectors of a linear dynamic-observation system, under the regular conditions such as perfect data information; complete noise statistics; exact linear modelling; ideal will-conditioned matrices in computation and strictly... |  |  Theory of Automata, Formal Languages and Computation
Presents an introduction to the basic models of computability to the undergraduate students. This book deals with Finite Automata and their properties. It provides a class of models and enables the analysis of context-free languages.
This book deals with a fascinating and important subject which has the
fundamentals of computer ... |  |  Computability and Complexity Theory (Texts in Computer Science)
This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of... |
|
 |  |  |  |  Getting Started with Storm
If you’re reading this, it’s because you heard about Storm somehow, and you’re interested
in better understanding what it does, how you can use it to solve various problems,
and how it works.
This book will get you started with Storm in a very straightforward and easy way.
The... |
|
Result Page: 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 |