Algorithms - ESA`99, Jaroslav Nesetril

Автор: Cormen, Thomas H., E
Название: Introduction to algorithms 3 ed.
ISBN: 0262033844 ISBN-13(EAN): 9780262033848
Издательство: MIT Press
Рейтинг:
Цена: 27588.00 р.
Наличие на складе: Нет в наличии.

Описание: A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.

Автор: Motwani, Rajeev Raghavan, Prabhakar
Название: Randomized algorithms
ISBN: 0521474655 ISBN-13(EAN): 9780521474658
Издательство: Cambridge Academ
Рейтинг:
Цена: 11722.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Presents basic tools from probability theory used in algorithmic applications, with concrete examples. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.

Автор: Coley, David
Название: Introduction to genetic algorithms for scientists and engineers
ISBN: 9810236026 ISBN-13(EAN): 9789810236021
Издательство: World Scientific Publishing
Рейтинг:
Цена: 6494.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The approach taken in this text is largely practical, with algorithms being presented in full and working code (in BASIC, FORTRAN, PASCAL and C) on the accompanying disk. Exercises are included at the end of several chapters, many of which are computer based.

Автор: Schapire Robert E., Freund Yoav
Название: Boosting: Foundations and Algorithms
ISBN: 0262526034 ISBN-13(EAN): 9780262526036
Издательство: MIT Press
Рейтинг:
Цена: 6772.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание:

An accessible introduction and essential reference for an approach to machine learning that creates highly accurate prediction rules by combining many weak and inaccurate ones.

Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate "rules of thumb." A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry. Boosting algorithms have also enjoyed practical success in such fields as biology, vision, and speech processing. At various times in its history, boosting has been perceived as mysterious, controversial, even paradoxical.

This book, written by the inventors of the method, brings together, organizes, simplifies, and substantially extends two decades of research on boosting, presenting both theory and applications in a way that is accessible to readers from diverse backgrounds while also providing an authoritative reference for advanced researchers. With its introductory treatment of all material and its inclusion of exercises in every chapter, the book is appropriate for course use as well.

The book begins with a general introduction to machine learning algorithms and their analysis; then explores the core theory of boosting, especially its ability to generalize; examines some of the myriad other theoretical viewpoints that help to explain and understand boosting; provides practical extensions of boosting for more complex learning problems; and finally presents a number of advanced theoretical topics. Numerous applications and practical illustrations are offered throughout.

Автор: Gusfield, Dan
Название: Algorithms on strings, trees and sequences
ISBN: 0521585198 ISBN-13(EAN): 9780521585194
Издательство: Cambridge Academ
Рейтинг:
Цена: 13147.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them.