A Common-Sense Guide to Data Structures and Algorithms: Level Up Your Core Programming Skills, Wengrow Jay
Новое издание
Автор: Wengrow Jay Название: A Common-Sense Guide to Data Structures and Algorithms, Second Edition: Level Up Your Core Programming Skills ISBN: 1680507222 ISBN-13(EAN): 9781680507225 Издательство: Wiley Цена: 42320 T Описание: This new edition features practice exercises in every chapter, and new chapters on topics such as dynamic programming and heaps and tries. Get the hands-on info you need to master data structures and algorithms for your day-to-day work.
Автор: Hiroshi Nagamochi, Toshihide Ibaraki Название: Algorithmic Aspects of Graph Connectivity ISBN: 1108735495 ISBN-13(EAN): 9781108735490 Издательство: Cambridge Academ Рейтинг: Цена: 39060 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing.
Автор: Haitham Hassanieh Название: The Sparse Fourier Transform ISBN: 1947487078 ISBN-13(EAN): 9781947487079 Издательство: Eurospan Рейтинг: Цена: 123080 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary.This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks; mobile systems; computer graphics; medical imaging; biochemistry; and digital circuits.This is a revised version of the thesis that won the 2016 ACM Doctoral Dissertation Award.
Автор: Foto Afrati, Rada Chirkova Название: Answering Queries Using Views ISBN: 1681730316 ISBN-13(EAN): 9781681730318 Издательство: Eurospan Рейтинг: Цена: 110880 T Наличие на складе: Нет в наличии. Описание: The topic of using views to answer queries has been popular for a few decades now, as it cuts across domains such as query optimization, information integration, data warehousing, website design, and, recently, database-as-a-service and data placement in cloud systems. This book assembles foundational work on answering queries using views in a self-contained manner.
Автор: Dobrushkin, Vladimir A. Название: Methods in algorithmic analysis ISBN: 1138118044 ISBN-13(EAN): 9781138118041 Издательство: Taylor&Francis Рейтинг: Цена: 66780 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer Science A flexible, interactive teaching format enhanced by a large selection of examples and exercises
Developed from the author's own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms. It exposes students to mathematical techniques and methods that are practical and relevant to theoretical aspects of computer science.
After introducing basic mathematical and combinatorial methods, the text focuses on various aspects of probability, including finite sets, random variables, distributions, Bayes' theorem, and Chebyshev inequality. It explores the role of recurrences in computer science, numerical analysis, engineering, and discrete mathematics applications. The author then describes the powerful tool of generating functions, which is demonstrated in enumeration problems, such as probabilistic algorithms, compositions and partitions of integers, and shuffling. He also discusses the symbolic method, the principle of inclusion and exclusion, and its applications. The book goes on to show how strings can be manipulated and counted, how the finite state machine and Markov chains can help solve probabilistic and combinatorial problems, how to derive asymptotic results, and how convergence and singularities play leading roles in deducing asymptotic information from generating functions. The final chapter presents the definitions and properties of the mathematical infrastructure needed to accommodate generating functions.
Accompanied by more than 1,000 examples and exercises, this comprehensive, classroom-tested text develops students' understanding of the mathematical methodology behind the analysis of algorithms. It emphasizes the important relation between continuous (classical) mathematics and discrete mathematics, which is the basis of computer science.
Автор: Siu-Wing Cheng, Tamal K. Dey, Jonathan Shewchuk Название: Delaunay Mesh Generation ISBN: 1584887303 ISBN-13(EAN): 9781584887300 Издательство: Taylor&Francis Рейтинг: Цена: 96790 T Наличие на складе: Невозможна поставка. Описание: Going beyond, yet thoroughly rooted to theory, this book provides a comprehensive look at the algorithms that can produce quality Delaunay meshes through a paradigm called the Delaunay refinement. It describes meshing algorithms that can be built on the Delaunay refinement paradigm along with the involved mathematical analysis.
Автор: Fomin, Fedor V. (universitetet I Bergen, Norway) Lokshtanov, Daniel (universitetet I Bergen, Norway) Saurabh, Saket (universitetet I Bergen, Norway) Z Название: Kernelization ISBN: 1107057760 ISBN-13(EAN): 9781107057760 Издательство: Cambridge Academ Рейтинг: Цена: 58070 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This self-contained introduction to kernelization, a rapidly developing area of preprocessing analysis, is for researchers, professionals, and graduate students in computer science and optimization. It includes recent advances in upper and lower bounds and meta-theorems, and demonstrates methods through extensive examples using a single data set.
Автор: Killingbeck Название: Microcomputer Algorithms ISBN: 1138402249 ISBN-13(EAN): 9781138402249 Издательство: Taylor&Francis Рейтинг: Цена: 154880 T Наличие на складе: Нет в наличии. Описание: Stresses the mathematical basis behind the use of many algorithms of computational mathematics, providing descriptions on how to generate algorithms for a large number of different uses. Covering a range of mathematical and physical applications, this book contains the theory of 25 algorithms.
Автор: Li, Fanzhang / Zhang, Li / Zhang, Zhao Название: Dynamic Fuzzy Machine Learning ISBN: 3110518708 ISBN-13(EAN): 9783110518702 Издательство: Walter de Gruyter Рейтинг: Цена: 153860 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Machine learning is widely used for data analysis. Dynamic fuzzy data are one of the most difficult types of data to analyse in the field of big data, cloud computing, the Internet of Things, and quantum information. At present, the processing of this kind of data is not very mature. The authors carried out more than 20 years of research, and show in this book their most important results. The seven chapters of the book are devoted to key topics such as dynamic fuzzy machine learning models, dynamic fuzzy self-learning subspace algorithms, fuzzy decision tree learning, dynamic concepts based on dynamic fuzzy sets, semi-supervised multi-task learning based on dynamic fuzzy data, dynamic fuzzy hierarchy learning, examination of multi-agent learning model based on dynamic fuzzy logic. This book can be used as a reference book for senior college students and graduate students as well as college teachers and scientific and technical personnel involved in computer science, artificial intelligence, machine learning, automation, data analysis, mathematics, management, cognitive science, and finance. It can be also used as the basis for teaching the principles of dynamic fuzzy learning.
Автор: Dan Gusfield Название: Integer Linear Programming in Computational and Systems Biology: An Entry-Level Text and Course ISBN: 1108421768 ISBN-13(EAN): 9781108421768 Издательство: Cambridge Academ Рейтинг: Цена: 58070 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Integer linear programming is a versatile modeling and optimization technique with potential to transform biological computation. This hands-on text, designed for students, researchers, and professionals in both biology and computational fields, demonstrates applications in genomics, RNA and protein folding, DNA sequencing, phylogenetics, and more.
Автор: Daniel Ashlock Название: Exploring Representation in Evolutionary Level Design ISBN: 1681733323 ISBN-13(EAN): 9781681733326 Издательство: Eurospan Рейтинг: Цена: 105340 T Наличие на складе: Нет в наличии. Описание: Automatic content generation is the production of content for games, web pages, or other purposes by procedural means. Search-based automatic content generation employs search-based algorithms to accomplish automatic content generation. This book presents a number of different techniques for search-based automatic content generation where the search algorithm is an evolutionary algorithm. The chapters treat puzzle design, the creation of small maps or mazes, the use of L-systems and a generalization of L-system to create terrain maps, the use of cellular automata to create maps, and, finally, the decomposition of the design problem for large, complex maps culminating in the creation of a map for a fantasy game module with designersupplied content and tactical features.The evolutionary algorithms used for the different types of content are generic and similar, with the exception of the novel sparse initialization technique are presented in Chapter 2. The points where the content generation systems vary are in the design of their fitness functions and in the way the space of objects being searched is represented. A large variety of different fitness functions are designed and explained, and similarly radically different representations are applied to the design of digital objects all of which are, essentially, maps for use in games.
Автор: Ashlock Daniel Название: Exploring Representation in Evolutionary Level Design ISBN: 1681733307 ISBN-13(EAN): 9781681733302 Издательство: Eurospan Рейтинг: Цена: 79830 T Наличие на складе: Нет в наличии. Описание: Automatic content generation is the production of content for games, web pages, or other purposes by procedural means. Search-based automatic content generation employs search-based algorithms to accomplish automatic content generation. This book presents a number of different techniques for search-based automatic content generation where the search algorithm is an evolutionary algorithm. The chapters treat puzzle design, the creation of small maps or mazes, the use of L-systems and a generalization of L-system to create terrain maps, the use of cellular automata to create maps, and, finally, the decomposition of the design problem for large, complex maps culminating in the creation of a map for a fantasy game module with designersupplied content and tactical features.The evolutionary algorithms used for the different types of content are generic and similar, with the exception of the novel sparse initialization technique are presented in Chapter 2. The points where the content generation systems vary are in the design of their fitness functions and in the way the space of objects being searched is represented. A large variety of different fitness functions are designed and explained, and similarly radically different representations are applied to the design of digital objects all of which are, essentially, maps for use in games.
Автор: Hassanieh Haitham Название: The Sparse Fourier Transform ISBN: 1947487043 ISBN-13(EAN): 9781947487048 Издательство: Eurospan Рейтинг: Цена: 98680 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary.This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks; mobile systems; computer graphics; medical imaging; biochemistry; and digital circuits.This is a revised version of the thesis that won the 2016 ACM Doctoral Dissertation Award.
Казахстан, 010000 Нур-султан(Астана) р-он Сарыарка, ул. Маскеу, 40 , офис 202 ТОО "Логобук" Тел:+7(7172) 448953 , +7 707 857-29-98 www.logobook.kz
