Computer Science, Algorithms and Complexity, Adele Kuzmiakova

Автор: Strang Gilbert
Название: Linear Algebra and Learning from Data
ISBN: 0692196382 ISBN-13(EAN): 9780692196380
Издательство: Cambridge Academ
Рейтинг:
Цена: 66520.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Linear algebra and the foundations of deep learning, together at last! From Professor Gilbert Strang, acclaimed author of Introduction to Linear Algebra, comes Linear Algebra and Learning from Data, the first textbook that teaches linear algebra together with deep learning and neural nets. This readable yet rigorous textbook contains a complete course in the linear algebra and related mathematics that students need to know to get to grips with learning from data. Included are: the four fundamental subspaces, singular value decompositions, special matrices, large matrix computation techniques, compressed sensing, probability and statistics, optimization, the architecture of neural nets, stochastic gradient descent and backpropagation.

Автор: Aurenhammer Franz
Название: Voronoi Diagrams and Delaunay Triangulations
ISBN: 9814447633 ISBN-13(EAN): 9789814447638
Издательство: World Scientific Publishing
Рейтинг:
Цена: 90370.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Voronoi diagrams partition space according to the influence certain sites exert on their environment. Since the 17th century, such structures play an important role in many areas like Astronomy, Physics, Chemistry, Biology, Ecology, Economics, Mathematics and Computer Science. They help to describe zones of political influence, to determine the hospital nearest to an accident site, to compute collision-free paths for mobile robots, to reconstruct curves and surfaces from sample points, to refine triangular meshes, and to design location strategies for competing markets.This unique book offers a state-of-the-art view of Voronoi diagrams and their structure, and it provides efficient algorithms towards their computation.Readers with an entry-level background in algorithms can enjoy a guided tour of gently increasing difficulty through a fascinating area. Lecturers might find this volume a welcome source for their courses on computational geometry. Experts are offered a broader view, including many alternative solutions, and up-to-date references to the existing literature; they might benefit in their own research or application development.

Автор: Chambers
Название: Practical handbook of genetic algorithms vol.3
ISBN: 0849325390 ISBN-13(EAN): 9780849325397
Издательство: Taylor&Francis
Рейтинг:
Цена: 183750.00 T
Наличие на складе: Нет в наличии.
Описание: Contains computer-code examples for the development of genetic algorithm systems. This book describes specific functions of genetic algorithms.

Автор: Jan Krajicek
Название: Proof Complexity
ISBN: 1108416845 ISBN-13(EAN): 9781108416849
Издательство: Cambridge Academ
Рейтинг:
Цена: 142560.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. Suitable for doctoral students and researchers in mathematics and theoretical computer science.

Автор: Arora, Sanjeev Barak, Boaz
Название: Computational complexity
ISBN: 0521424267 ISBN-13(EAN): 9780521424264
Издательство: Cambridge Academ
Рейтинг:
Цена: 60190.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.

Автор: Barthelemy, Jean-Pierre.
Название: Algorithmic Complexity and Telecommunication Problems
ISBN: 1857284518 ISBN-13(EAN): 9781857284515
Издательство: Taylor&Francis
Рейтинг:
Цена: 79610.00 T
Наличие на складе: Нет в наличии.
Описание: In this treatment of algorithmic complexity the authors explore an area fundamental to the study of the foundations of computer science. It is a topic which is at the interface of information theory, applied mathematics and computer language theory and which is rooted strongly in this book in the problems of computer communication.; Complexity theory classifies problems according to the difficulty of resolving them, while algorithms provide the computational method for solving those problems. Therefore, algorithmic complexity is concerned with establishing the best algorithm given the constraints of the computational environment and the degree of complexity.; The first three chapters present the context for a later in-depth look at applied areas of the subject, with an outline of classical complexity theory. This is followed by three chapters which explore the key area of information communication. Within this field, the book is particularly concerned with two contiguous areas which make contrasting demands on the application of algorithmic complexity. Cryptography demands the creation of extremely complex problems in order to achieve its goal of security, whereas in coding for communication the emphasis is on maximizing the compact nature of the message and providing the error correction necessary for the message to achieve optimum speed. The two must co-exist and the methods outlined in Algorithmic Complexity suggest a number of approaches to such problems based on extensive examples of the authors' experience.; This senior undergraduate book should be an essential read for those studying advanced topics in theoretical computer science and should provide an introduction to applied complexity for researchers and professionals alike.

Автор: Tor Lattimore, Csaba Szepesvari
Название: Bandit Algorithms
ISBN: 1108486827 ISBN-13(EAN): 9781108486828
Издательство: Cambridge Academ
Рейтинг:
Цена: 46470.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Decision-making in the face of uncertainty is a challenge in machine learning, and the multi-armed bandit model is a common framework to address it. This comprehensive introduction is an excellent reference for established researchers and a resource for graduate students interested in exploring stochastic, adversarial and Bayesian frameworks.

Автор: Liao Heng
Название: Mathematics for Future Computing and Communications
ISBN: 1316513580 ISBN-13(EAN): 9781316513583
Издательство: Cambridge Academ
Рейтинг:
Цена: 57030.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: New mathematical ideas go hand-in-hand with innovation in computing, communications and AI. Such innovations are described here in a book that provides a panorama of ideas and applications in computer architecture, software verification, quantum computing, compressed sensing, Bayesian inference, machine learning, reinforcement learning and more.

Автор: Yiannis N. Moschovakis
Название: Abstract Recursion and Intrinsic Complexity
ISBN: 110841558X ISBN-13(EAN): 9781108415583
Издательство: Cambridge Academ
Рейтинг:
Цена: 121440.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems.

Автор: Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Название: Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives
ISBN: 1611976987 ISBN-13(EAN): 9781611976984
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 82770.00 T
Наличие на складе: Нет в наличии.
Описание: One of the most popular ways to assess the "effort" needed to solve a problem is to count how many evaluations of the problem functions (and their derivatives) are required. In many cases, this is often the dominating computational cost. Given an optimization problem satisfying reasonable assumptions—and given access to problem-function values and derivatives of various degrees—how many evaluations might be required to approximately solve the problem? Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives addresses this question for nonconvex optimization problems, those that may have local minimizers and appear most often in practice. This is the first bookon complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems,to address the disadvantages of traditional optimality measures and propose useful surrogates leading to algorithms that compute approximate high-order critical points, and to compare traditional and new methods, highlighting the advantages of the latter from a complexity point of view.This is the go-to book for those interested in solving nonconvex problems. It is suitable for advanced undergraduate and graduate students in courses on Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory.

Автор: Unknown, Author
Название: Algorithms And Complexity,A
ISBN: 0444880712 ISBN-13(EAN): 9780444880710
Издательство: Elsevier Science
Рейтинг:
Цена: 56130.00 T
Наличие на складе: Поставка под заказ.
Описание: This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.

Автор: von zur Gathen
Название: Modern Computer Algebra
ISBN: 1107039037 ISBN-13(EAN): 9781107039032
Издательство: Cambridge Academ
Рейтинг:
Цена: 117210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students, this textbook is widely regarded as the `bible of computer algebra`. Its comprehensiveness and reliability also makes it an essential reference for professionals. This updated edition includes an overview of recent improvements in areas like primality testing.