Hasil Pencarian  ::  Simpan CSV :: Kembali

"A discussion of some topics in the theory of large deviations such as moment-generating functions and Chernoff's theorem, and of aspects of estimation and testing in large samples, such as exact slopes of test statistics."

"Originally published in 1986, this valuable reference provides a detailed treatment of limit theorems and inequalities for empirical processes of real-valued random variables. It also includes applications of the theory to censored data, spacings, rank statistics, quantiles, and many functionals of empirical processes, including a treatment of bootstrap methods, and a summary of inequalities that are useful for proving limit theorems. At the end of the Errata section, the authors have supplied references to solutions for 11 of the 19 Open Questions provided in the book's original edition."

"Population processes are stochastic models for systems involving a number of similar particles. Examples include models for chemical reactions and for epidemics. The model may involve a finite number of attributes, or even a continuum. This monograph considers approximations that are possible when the number of particles is large. The models considered will involve a finite number of different types of particles."

"The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods."

"Unlike other books on theoretical computer science, this textbook organizes approximation algorithms into chapters based on the design techniques for the algorithms. based on the design techniques for the algorithms. It helps the reader to better understand the design and analysis techniques for approximation algorithms."