Kniha Computational Complexity and Feasibility of Data Processing and Interval Computations V. Kreinovich

Computational Complexity and Feasibility of Data Processing and Interval Computations

Jazyk: Angličtina
Vazba: Brožovaná
Vydavatel: Springer, Berlin
Dostupnost: Skladem u dodavatele
Odesíláme za 5-8 dnů
4 566
The input data for data processing algorithms come from measurements and are hence not precise. We t...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Brožovaná
Vydáno
2010
Stránek
459
EAN
9781441947857
ISBN
144194785X
Enbook ID
01423219
Vydavatel
Hmotnost
916
Rozměry
160 x 240 x 24

Kompletní popis

The input data for data processing algorithms come from measurements and are hence not precise. We therefore need to estimate the accuracy of the results of data processing. It turns out that even for the simplest data processing algorithms, this problem is, in general, intractable. This book describes for what classes of problems interval computations (i.e. data processing with automatic results verification) are feasible, and when they are intractable. This knowledge is important, e.g. for algorithm developers, because it will enable them to concentrate on the classes of problems for which general algorithms are possible.

Mohlo by vás zajímat

Reich Rails

Taylor Blaine
694
409
5 023
350
6 203
1 132

Witch's Way

Shawn Robbins
485

Land Whisperer

Perry Carol Rosenblum Perry
299
522
471
614
541

Hearty

bennett
381
248

VIVALDI COLLECTION

Antonio Vivaldi
637

Zákaznicí kteří koupili tuto knihu koupili také

537

X-Men 4

Chris Claremont
231
204

Netzwerkmedizin

Eugen Münch
850