Зарегистрироваться
Восстановить пароль
FAQ по входу

Алгоритмы и структуры данных

Требуется помощь в преобразовании раздела Компьютерная литература

Если Вы компетентны в тематике этого раздела, то Вас, возможно, заинтересует обсуждение планируемых преобразований.

Смотри также

Теги, соответствующие этому тематическому разделу

Файлы, которые ищут в этом разделе

Доверенные пользователи и модераторы раздела

  • Без фильтрации типов файлов
Pittsburgh: Carnegie Mellon University, 2019. — 358 p. This book aims to present techniques for problem solving using today’s computers, including both sequentially and parallel. For example, you might want to find the shortest path from where you are now to the nearest cafe by using your computer. The primary concerns will likely include correctness (the path found indeed should...
  • №1
  • 6,54 МБ
  • добавлен
  • изменен
Springer, 2008. — 353 p. The Burrows-Wheeler Transform is one of the best lossless compression methods available. It is an intriguing — even puzzling — approach to squeezing redundancy out of data, it has an interesting history, and it has applications well beyond its original purpose as a compression method. It is a relatively late addition to the compression canon, and hence...
  • №2
  • 2,09 МБ
  • добавлен
  • изменен
Second Edition. — Packt Publishing, 2017. — 398 p. Python Objects, Types, and Expressions. Python Data Types and Structures. Principles of Algorithm Design. Lists and Pointer Structures. Stacks and Queues. Trees. Hashing and Symbol Tables. Graphs and Other Algorithms. Searching. Sorting. Selection Algorithms. String Algorithms and Techniques. Design Techniques and Strategies....
  • №3
  • 10,44 МБ
  • добавлен
  • изменен
Оригинал работы трех индийских математиков об алгоритме проверки числа на простоту (АКС - алгоритм). Дата публикации - 6 августа 2002 года "Abstract We present an unconditional deterministic polynomial-time algorithm that determines whether an input number is prime or composite. " Основным достижением авторов является то, что тест АКС является первым опубликованным...
  • №4
  • 195,27 КБ
  • дата добавления неизвестна
  • изменен
Addison-Wesley, 1985. — 400 p. — ISBN: 0201000237 This book presents the data structures and algorithms that underpin much of today’s computer programming. The basis of this book is the material contained in the first six chapters of our earlier work, The Design and Analysis of Computer Algorithms. We have expanded that coverage and have added material on algorithms for...
  • №5
  • 4,33 МБ
  • добавлен
  • изменен
Chapman and Hall/CRC, 2014. — 562 p. — ISBN: 9781466578371 Due to market forces and technological evolution, Big Data computing is developing at an increasing rate. A wide variety of novel approaches and tools have emerged to tackle the challenges of Big Data, creating both more opportunities and more challenges for students and professionals in the field of data computation...
  • №6
  • 22,55 МБ
  • добавлен
  • изменен
John Wiley, 2005. — 575. The present book is the result of an ambitious project to bring together the various visions of researchers in both the parallelism and metaheuristic fields, with a main focus on optimization. In recent years, devising parallel models of algorithms has been a healthy field for developing more efficient optimization procedures. What most people using...
  • №7
  • 9,47 МБ
  • добавлен
  • изменен
Необходимость фильтрации строк. Стандартные методы фильтрации строк. Фильтрация строк. Структура библиотеки JFilter. Классы. Описание. Применение. Правила, входящие в поставку. Сравнение работы разных типов обработки строк. Заключение. Литература. НЕОБХОДИМОСТЬ ФИЛЬТРАЦИИ СТРОК. Строки используются очень часто. А применимо к Интернет-программированию можно сказать, что...
  • №8
  • 153,21 КБ
  • дата добавления неизвестна
  • изменен
CRC Press, 2009. — 1044. The physical design flow of any project depends upon the size of the design, the technology, the number of designers, the clock frequency, and the time to do the design. As technology advances and design-styles change, physical design flows are constantly reinvented as traditional phases are removed and new ones are added to accommodate changes in...
  • №9
  • 17,58 МБ
  • добавлен
  • изменен
Revised Edition. — World Scientific Publishing, 2016. — 571 p. — (Lecture Notes Series on Computing - Vol. 14). — ISBN: 9814723649, 9789814723640 Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc...
  • №10
  • 3,36 МБ
  • добавлен
  • изменен
Dhahran: King Fahd University of Petroleum & Minerals, 1998. - 430p. The field of computer algorithms has flourished since the early 1960's when the 1rst users of electronic computers started to pay attention to the performance of programs. The limited resources of computers at that time resulted in additional impetus for devising efficient computer algorithms. After extensive...
  • №11
  • 1,93 МБ
  • добавлен
  • изменен
Routledge, 2016. — 265 p. — ISBN: 113885283X, 9781138852839 This book critically explores forms and techniques of calculation that emerge with digital computation, and their implications. The contributors demonstrate that digital calculative devices matter beyond their specific functions as they progressively shape, transform and govern all areas of our life. In particular, it...
  • №12
  • 3,16 МБ
  • добавлен
  • изменен
Apple Academic Press, 2011. — 350 p. — ISBN: 1926692977, 9781466562608 Data structure and software engineering is an integral part of computer science. This volume presents new approaches and methods to knowledge sharing, brain mapping, data integration, and data storage. The author describes how to manage an organization’s business process and domain data and presents new...
  • №13
  • 6,03 МБ
  • добавлен
  • изменен
Springer International Publishing AG, 2017. — 159 p. — (Advanced Courses in Mathematics CRM Barcelona) — ISBN 978-3-319-60939-3. This volume presents the lecture notes from the authors’ three summer courses offered during the program “Automorphisms of Free Groups: Geometry, Topology, and Dynamics,” held at the Centre de Recerca Matemàtica (CRM) in Bellaterra, Spain. The first two...
  • №14
  • 1,66 МБ
  • добавлен
  • изменен
2010, -978 pp. Обновленная и значительно расширенная версия книги «Algorithms for Programmers» Йорга Арндта. This is a book for the computationalist, whether a working programmer or anyone interested in methods of computation. The focus is on material that does not usually appear in textbooks on algorithms. Where necessary the underlying ideas are explained and the...
  • №15
  • 5,16 МБ
  • добавлен
  • изменен
The Fourier transform. The discrete Fourier transform (DFT). Radix 2 FFT algorithms. Decimation in time (DIT) FFT. Decimation in frequency (DIF) FFT. Using higher radix algorithms. Higher radix DIT and DIF algorithms. Split radix Fourier transforms (SRFT). Multidimensional FTs. The matrix Fourier algorithm (MFA). Eigenvectors of the Fourier transform. Convolutions. Weighted...
  • №16
  • 1,07 МБ
  • дата добавления неизвестна
  • изменен
ISTE / John Wiley, 2008. — 293 p. Nowadays, material and human resource management is an increasingly important issue for organizations. Thus, a careful management of projects is an absolute necessity to preserve the competitiveness of companies. Scheduling plays a major part in project management. Indeed, the scheduling process amounts to deciding when the project activities...
  • №17
  • 1,99 МБ
  • добавлен
  • изменен
Springer, 1999. — 535 p. The complexity of optimization problems Design techniques for approximation algorithms Approximation classes Input-dependent and asymptotic approximation Approximation through rando NP, PCP and non-approximability results The PCP theorem Approximation preserving reductions Probabilistic analysis of approximation algorithms Heuristic methods A. Mathematical...
  • №18
  • 28,25 МБ
  • добавлен
  • изменен
Apress, 2016. — 147 p. in color. — ISBN: 9781484213278 This book highlights the different types of data architecture and illustrates the many possibilities hidden behind the term "Big Data", from the usage of No-SQL databases to the deployment of stream analytics architecture, machine learning, and governance. Scalable Big Data Architecture covers real-world, concrete industry...
  • №19
  • 1,81 МБ
  • добавлен
  • изменен
Apress, 2016. — 147 p. in color. — ISBN: 9781484213278 This book highlights the different types of data architecture and illustrates the many possibilities hidden behind the term "Big Data", from the usage of No-SQL databases to the deployment of stream analytics architecture, machine learning, and governance. Scalable Big Data Architecture covers real-world, concrete industry...
  • №20
  • 4,12 МБ
  • добавлен
  • изменен
Рассмотрена методология суффиксных деревьев и анализ времени работы. В приложении приведены коды программ (на чистом С) -- реализация суффиксного дерева и раскладки его в графический файл. Один из разделов содержит примеры задач, решаемых с помощью этого аппарата. Саратовский Государственный Университет, механико-математический факультет.
  • №21
  • 545,76 КБ
  • дата добавления неизвестна
  • изменен
John Wiley & Sons, 2011. — 432 p. — ISBN: 0470684534. An entertaining and captivating way to learn the fundamentals of using algorithms to solve problems The algorithmic approach to solving problems in computer technology is an essential tool. With this unique book, algorithm guru Roland Backhouse shares his four decades of experience to teach the fundamental principles of...
  • №22
  • 3,94 МБ
  • добавлен
  • изменен
Wiley, 2014. — 256 p. — (Wiley and SAS Business Series). — ISBN: 1118892704, 9781118892701 The guide to targeting and leveraging business opportunities using big data & analytics By leveraging big data & analytics, businesses create the potential to better understand, manage, and strategically exploiting the complex dynamics of customer behavior. Analytics in a Big Data...
  • №23
  • 4,03 МБ
  • добавлен
  • изменен
Charles River Media, 2004. — 620 p. — ISBN 9781584502500. Focusing on three core topics: design (the architecture of algorithms), theory (mathematical modeling and analysis), and the scientific method (experimental confirmation of theoretical results), the book helps students see that computer science is about problem solving, not simply the memorization and recitation of...
  • №24
  • 10,25 МБ
  • добавлен
  • изменен
Издательство Springer, 2006, -664 pp. Since a real univariate polynomial does not always have real roots, a very natural algorithmic problem, is to design a method to count the number of real roots of a given polynomial (and thus decide whether it has any). The real root counting problem plays a key role in nearly all the algorithms in real algebraic geometry studied in this...
  • №25
  • 4,85 МБ
  • добавлен
  • изменен
Springer, 2006. — 275 p. — (Data-Centric Systems and Applications). — ISBN: 3540331727 This book is an ideal combination of the soundness of theoretical foundations and the applicability of practical approaches. It is ideally suited for everyone – researchers, students, or professionals – interested in a comprehensive overview of data quality issues. In addition, it will serve as...
  • №26
  • 2,87 МБ
  • добавлен
  • изменен
Springer, 2013. — 377 p. 82 illus., 12 illus. in color — ISBN: 3642354939, 9783642354939 This Festschrift in honour of Ursula Gather’s 60th birthday deals with modern topics in the field of robust statistical methods, especially for time series and regression analysis, and with statistical methods for complex data structures. The individual contributions of leading experts...
  • №27
  • 11,25 МБ
  • добавлен
  • изменен
Eight edition 1996. Introduction. Fundamentals. Perceptron and Adaline. Back-Propagation. Recurrent Networks. Self-Organizing Networks. Reinforcement learning. Robot Control. Vision. General Purpose Hardware. Dedicated Neuro-Hardware.
  • №28
  • 560,45 КБ
  • дата добавления неизвестна
  • изменен
Bell Telephone Laboratories, 1988. — 204 р. What do topics ranging from organic chemistry to Napoleon's campaigns have to do with computer programming? This collection of essays demonstrates the many varied aspects of programming, showing how programming can be both a fun and elegant science. Some of the essays cover programming techniques, like how profilers can provide insight...
  • №29
  • 1,48 МБ
  • добавлен
  • изменен
Morgan Kaufmann / Elsevier, 2013. — 288 p. — ISBN: 0124045766, 9780124045767 Principles of Big Data helps readers avoid the common mistakes that endanger all Big Data projects. By stressing simple, fundamental concepts, this book teaches readers how to organize large volumes of complex data, and how to achieve data permanence when the content of the data is constantly changing....
  • №30
  • 4,71 МБ
  • добавлен
  • изменен
Kenneth A. Berman, Jerome L. Paul, Course Technology, 2005, pages: 996 Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel computers,...
  • №31
  • 35,29 МБ
  • добавлен
  • изменен
Academic Press, 1972. - 235 Pages. Up to the present dynamic programming has been regarded as a general type of approach to problem solving, essentially based on decomposition of the given problem into a sequence of smaller subproblems. It has permitted the solution of a remarkable number of problems (deterministic and stochastic, continuous and discrete, constrained and...
  • №32
  • 1,40 МБ
  • дата добавления неизвестна
  • изменен
Solution manual to "Introduction to Algorithms Second Edition by Cormen T.H., Leiserson C.E., Rivest R.L., Stein C." — Technical University of Denmark, Copenhagen. 2002. — 51 p. Foundations Sorting and Order Statistics Data Structures Advanced Design and Analysis Techniques Advanced Data Structures Graph Algorithms Selected Topics
  • №33
  • 257,16 КБ
  • добавлен
  • изменен
Cambridge University Press, 2010. — 290 p. — ISBN: 0521513383, 9780521513388 Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression...
  • №34
  • 1,42 МБ
  • добавлен
  • изменен
Cambridge University Press, 2010. — 291 p. — ISBN 13: 978-0-521-51338-8. Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and...
  • №35
  • 1,98 МБ
  • добавлен
  • изменен
Springer, 2007. — 654. This handbook is in a sense a continuation of Scheduling Computer and Manufacturing Processes , two editions of which have received kind acceptance of a wide readership. As the previous volume, it is the result of a long lasting German- Polish collaboration. However, due to important reasons, it has a new form. Namely, following the suggestions of the...
  • №36
  • 7,92 МБ
  • добавлен
  • изменен
CUP, 1998. - 544 p. Geometric data structures and their systematic analysis guided the layout of this text. We have dedicated a part to each of the fundamental geometric structures: polytopes, triangulations, arrangements, and Voronoi diagrams. Combinatorial geometry plays an essential role in this book and the first chapters of each part lay the mathematical grounds and prove...
  • №37
  • 3,11 МБ
  • добавлен
  • изменен
We propose elementary ASCII exchange formats for matrices. Specific instances of the format are defined for dense and sparse matrices with real, complex, integer and pattern entries, with special cases for symmetric, skew-symmetric and Hermitian matrices. Sparse matrices are represented in a coordinate storage format. The overall file structure is designed to allow future...
  • №38
  • 200,66 КБ
  • дата добавления неизвестна
  • изменен
Cambridge University Press; 1 edition (September 8, 2008) — 472 p. — ISBN: 978-0521880374 Advanced Data Structures presents a comprehensive look at the ideas, analysis, and implementation details of data structures as a specialized topic in applied algorithms. Data structures are how data is stored within a computer, and how one can go about searching for data within. This text...
  • №39
  • 2,03 МБ
  • добавлен
  • изменен
Издательство Academic Press, 2004, -353 pp. Подробно изложена математическая основа косинусного и синусного преобразований, а также быстрые алгоритмы вычисления преобразований. Особое внимание уделено целочисленным алгоритмам. Discrete Cosine and Sine Transforms Definitions and General Properties The Karhunen–Loéve Transform and Optimal Decorrelation Fast DCT/DST...
  • №40
  • 2,92 МБ
  • дата добавления неизвестна
  • изменен
Lulu, 2011. — 436 p. — ISBN: 978-1-4467-8506-5 Welcome to Clever Algorithms! This is a handbook of recipes for computational problem solving techniques from the fields of Computational Intelligence, Biologically Inspired Computation, and Metaheuristics. Clever Algorithms are interesting, practical, and fun to learn about and implement. Research scientists may be interested in...
  • №41
  • 2,99 МБ
  • добавлен
  • изменен
2016. — 162 p. The book was designed to teach developers about machine learning algorithms. It includes both procedural descriptions of machine learning algorithms and step-by-step tutorials that show exactly how to plug-in numbers into the various equations and exactly what numbers to expect on the other side.
  • №42
  • 1,09 МБ
  • добавлен
  • изменен
Springer, 2007. — 379 p. This is a book about scheduling algorithms. The first such algorithms were formulated in the mid fifties. Since then there has been a growing interest in scheduling. During the seventies, computer scientists discovered scheduling as a tool for improving the performance of computer systems. Furthermore, scheduling problems have been investigated and...
  • №43
  • 1,61 МБ
  • добавлен
  • изменен
Издательство Springer, 2007, -326 pp. This book deals with algorithmic problems concerning binary quadratic forms f(X,Y)=aX 2 +bXY+cY 2 with integer coefficients a, b, c, the mathematical theories that permit the solution of these problems, and applications to cryptography. A considerable part of the theory is developed for forms with real coefficients and it is shown that...
  • №44
  • 2,09 МБ
  • добавлен
  • изменен
Издательство Kluwer, 2004, -343 pp. This book is based on contributions to two workshops in the series International Workshop on Parsing Technology. IWPT2000, the 6th workshop in the series, was held in Trento, Italy, in February 2001, and was organized by John Carroll (Programme Chair), Harry Bunt (General Chair) and Alberto Lavelli (Local Chair). The 7th workshop, IWPT2001,...
  • №45
  • 8,47 МБ
  • добавлен
  • изменен
Издательство Kluwer, 2004, -343 pp. This book is based on contributions to two workshops in the series International Workshop on Parsing Technology. IWPT2000, the 6th workshop in the series, was held in Trento, Italy, in February 2001, and was organized by John Carroll (Programme Chair), Harry Bunt (General Chair) and Alberto Lavelli (Local Chair). The 7th workshop, IWPT2001,...
  • №46
  • 3,16 МБ
  • добавлен
  • изменен
Springer, 2011. — 538 p. Real-time computing plays a crucial role in our society since an increasing number of complex systems rely, in part or completely, on computer control. Examples of applications that require real-time computing include nuclear power plants, railway switching systems, automotive and avionic systems, air traffic control, telecommunications, robotics, and...
  • №47
  • 2,56 МБ
  • добавлен
  • изменен
Morgan Kaufmann, 2016. — 477 p. — ISBN 978-0-12-805394-2 Big Data: Principles and Paradigms captures the state-of-the-art research on the architectural aspects, technologies, and applications of Big Data. The book identifies potential future directions and technologies that facilitate insight into numerous scientific, business, and consumer applications. To help realize Big...
  • №48
  • 37,30 МБ
  • добавлен
  • изменен
Springer, 2019. — 111 р. — ISBN 978-3030023744. This book explores the updated version of the GLOBAL algorithm which contains improvements for a local search algorithm and new Java implementations. Efficiency comparisons to earlier versions and on the increased speed achieved by the parallelization, are detailed. Examples are provided for students as well as researchers and...
  • №49
  • 3,26 МБ
  • добавлен
  • изменен
Springer, 2019. — 111 р. — ISBN 978-3030023744. This book explores the updated version of the Global algorithm which contains improvements for a local search algorithm and new Java implementations. Efficiency comparisons to earlier versions and on the increased speed achieved by the parallelization, are detailed. Examples are provided for students as well as researchers and...
  • №50
  • 7,00 МБ
  • добавлен
  • изменен
Princeton University Press, 2004. — 211 p. The general areas of failure detection and model identification cover a number of different technical areas and numerous types of applications. No book could hope to cover all of this material. This book focuses on one particular approach to failure detection which is the use of auxiliary signals to assist in multimodel...
  • №51
  • 1,77 МБ
  • добавлен
  • изменен
World Scientific, 2003. — 354. Data Structures and Algorithms is the first textbook in hard copy produced by the Macro University Consortium. It is intended for undergraduate students in computer science and information sciences. The thirteen chapters written by an international group of experienced teachers cover the fundamental concepts of algorithms and most of the important...
  • №52
  • 6,34 МБ
  • добавлен
  • изменен
N.Y.: Programmers Mind Inc, 2014. — 233 p. This book gives a good start and Complete introduction for data structures and algorithms for Beginner’s. While reading this book it is fun and easy to read it. This book is best suitable for first time DSA readers, Covers all fast track topics of DSA for all Computer Science students and Professionals. Data Structures and Other...
  • №53
  • 1,61 МБ
  • добавлен
  • изменен
NYU Press, USA, 2017. — 144 p. — ISBN 978-1479857599. What identity means in an algorithmic age: how it works, how our lives are controlled by it, and how we can resist it Algorithms are everywhere, organizing the near limitless data that exists in our world. Derived from our every search, like, click, and purchase, algorithms determine the news we get, the ads we see, the...
  • №54
  • 1,32 МБ
  • добавлен
  • изменен
21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II 493 pages published 2011 This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010. The 77 revised full papers presented were carefully reviewed and selected from...
  • №55
  • 4,57 МБ
  • дата добавления неизвестна
  • изменен
Издательство Springer, 2006, -212 pp. The aim of this book is to outline the recent development of Markov chain models for modeling queueing systems, Internet, re-manufacturing systems, inventory systems, DNA sequences, genetic networks and many other practical systems. This book consists of eight chapters. In Chapter 1, we give a brief introduction to the classical theory on...
  • №56
  • 1,08 МБ
  • добавлен
  • изменен
Springer, 2012. — 272 p. — ISBN 978-3-642-31163-5. Introduction The Data Matching Process Data Pre-Processing Indexing Field and Record Comparison
  • №57
  • 2,77 МБ
  • добавлен
  • изменен
The MIT Press, 2013. - 240 pages. На англ. языке. Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate...
  • №58
  • 2,50 МБ
  • добавлен
  • изменен
The MIT Press, 2009. - 1312 pages. 3rd edition. ISBN-13: 978-0262033848 Solutions for a select set of exercises and problems for Introduction to Algorithms, Third Edition . Contents: Selected Solutions for Chapter 2: Getting Started Selected Solutions for Chapter 3: Growth of Functions Selected Solutions for Chapter 4: Divide-and-Conquer Selected Solutions for Chapter...
  • №59
  • 439,20 КБ
  • добавлен
  • изменен
3rd Edition. — MIT Press, 2009. — 499 p. Руководство инструктора для 3-ей редакции фундаментальной книги по алгоритмам Томаса Кормена "Алгоритмы. Построение и анализ" включает в себя решения всех задач из книги, а также краткую выжимку информации по каждой главе для удобного запоминания. This document is an instructor’s manual to accompany Introduction to Algorithms, Third...
  • №60
  • 2,12 МБ
  • добавлен
  • изменен
3rd Edition. — MIT Press, 2009. — 1312 p. — ISBN 978-0262033848. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is...
  • №61
  • 4,84 МБ
  • дата добавления неизвестна
  • изменен
Hardcover: 1056 pages Publisher: McGraw-Hill Science/Engineering/Math; 2 edition (July 16, 2001) Language: English ISBN-10: 9780070131514 ISBN-13: 978-0070131514 ASIN: 0070131511 Product Dimensions: 8.9 x 8.3 x 2 inches Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein The MIT Press Cambridge , Massachusetts London, England McGraw-Hill Book...
  • №62
  • 12,51 МБ
  • дата добавления неизвестна
  • изменен
Издательство Cambridge University Press, 2007, -393 pp. This book is intended for lectures on string processing and pattern matching in master’s courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language....
  • №63
  • 1,71 МБ
  • добавлен
  • изменен
Springer, 2015. — 613 p. — ISBN: 3319212745 This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut &...
  • №64
  • 7,72 МБ
  • добавлен
  • изменен
Routledge, 2011. – 192 p. – ISBN: 0415561833, 0415561841, 9780415561846 This book looks at relationships between the organization of physical objects in space and the organization of ideas. Historical, philosophical, psychological and architectural knowledge are united to develop an understanding of the relationship between information and its representation. Despite its...
  • №65
  • 3,17 МБ
  • добавлен
  • изменен
New Age International, 2006 — 376 p. Principles of DATA STRUCTURES using C and C++ covers all the fundamental topics to give a better understanding about the subject. The study of data structures is essential to every one who comes across with computer science. This book is written in accordance with the revised syllabus for B.Tech./B.E. (both Computer Science and Electronics...
  • №66
  • 2,41 МБ
  • добавлен
  • изменен
Издательство John Wiley, 2013, -535 pp. This text attempts to realize a number of goals. First, the book attempts to introduce the reader to a number of classical facility location models on which other more complicated and realistic models are based. Second, the book tries to assist the reader in developing his or her own modeling skills. Toward that end, many of the exercises...
  • №67
  • 28,82 МБ
  • добавлен
  • изменен
Ciml.info; TODO, 2015. — 227 p. This is a set of introductory materials that covers most major aspects of modern machine learning (supervised learning, unsupervised learning, large margin methods, probabilistic modeling, learning theory, etc.). It's focus is on broad applications with a rigorous backbone. A subset can be used for an undergraduate course; a graduate course could...
  • №68
  • 2,51 МБ
  • добавлен
  • изменен
Ciml.info; Published by TODO, 2015. — 227 p. This is a set of introductory materials that covers most major aspects of modern machine learning (supervised learning, unsupervised learning, large margin methods, probabilistic modeling, learning theory, etc.). It's focus is on broad applications with a rigorous backbone. A subset can be used for an undergraduate course; a graduate...
  • №69
  • 2,20 МБ
  • добавлен
  • изменен
Издательство Springer, 2010, -550 pp. Triangulations appear in many different parts of mathematics and computer science since they are the natural way to decompose a region of space into smaller, easy-to-handle pieces. From volume computations and meshing to algebra and topology, there are many natural situations in which one has a fixed set of points that can be used as...
  • №70
  • 5,06 МБ
  • добавлен
  • изменен
Berlin: Springer-Verlag, 1989. – 600 р. This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Data Structures, WADS 2005, held in Waterloo, Canada, in August 2005. The 37 revised full papers presented were carefully reviewed and selected from 90 submissions. A broad variety of topics in algorithmics and data structures is addressed...
  • №71
  • 5,49 МБ
  • добавлен
  • изменен
Springer, 2013. — 552 p. — ISBN: 3642401031. На англ. языке. This book constitutes the refereed proceedings of the 13th Algorithms and Data Structures Symposium, WADS 2013, held in London, ON, Canada, August 2013. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of...
  • №72
  • 7,49 МБ
  • добавлен
  • изменен
Springer, 1986. — 157 p. Hashing algorithms scramble data and create pseudo-uniform data distributions. Bucket algorithms operate on raw untransformed data which are partitioned Into groups according to membership In equal-slzed d-dlmenslonal hyperrectangles, called cells or buckets. The bucket data structure Is rather sensitive to the distribution of the data. In these lecture...
  • №73
  • 2,16 МБ
  • добавлен
  • изменен
Springer, 1986. — 157 p. Hashing algorithms scramble data and create pseudo-uniform data distributions. Bucket algorithms operate on raw untransformed data which are partitioned Into groups according to membership In equal-slzed d-dlmenslonal hyperrectangles, called cells or buckets. The bucket data structure Is rather sensitive to the distribution of the data. In these lecture...
  • №74
  • 1,74 МБ
  • добавлен
  • изменен
New York: ICI Global, 2017. — 358 p. Metaheuristic algorithms are present in various applications for different domains. Recently, researchers have conducted studies on the effectiveness of these algorithms in providing optimal solutions to complicated problems. Advancements in Applied Metaheuristic Computing is a crucial reference source for the latest empirical research on...
  • №75
  • 17,33 МБ
  • добавлен
  • изменен
Издательство Springer, 2005, -432 pp. The subject of this book is the solution of polynomial equations, that is, systems of (generally) non-linear algebraic equations. This study is at the heart of several areas of mathematics and its applications. It has provided the motivation for advances in different branches of mathematics such as algebra, geometry, topology, and numerical...
  • №76
  • 3,03 МБ
  • добавлен
  • изменен
Morgan & Claypool, 2015. — 199 p. in color. — (Synthesis Lectures on Data Management). — ISBN: 1627052232, 9781627052238 The big data era is upon us: data are being generated, analyzed, and used at an unprecedented scale, and data-driven decision making is sweeping through all aspects of society. Since the value of data explodes when it can be linked and fused with other data,...
  • №77
  • 3,37 МБ
  • добавлен
  • изменен
Книги по алгоритмам и структурам данных из серии Dr. Dobb’s Essential (9 классических книг и подборка статей с примерами кода). Data Structures and Algorithms by Alfred V. Aho, Murray Hill, John E. Hopcroft, and Jeffrey D. Ullman Data Structures: From Arrays to Priority Queues by Wayne Amsbury Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, and Ronald...
  • №78
  • 31,02 МБ
  • добавлен
  • изменен
Издательство Brooks/Cole, 2001, -665 pp. The study of data structures, a fundamental component of a computer science education, serves as the foundation upon which many other computer science fields are built. Some knowledge of data structures is a must for students who wish to do work in design implementation, testing, or maintenance of virtually any software system. The scope...
  • №79
  • 5,55 МБ
  • добавлен
  • изменен
Cengage Learning, 2012. — 818 p. — 4th ed. — ISBN: 1133608426, 9781133608424 Strengthen your understanding of data structures and their algorithms for the foundation you need to successfully design, implement and maintain virtually any software system. Theoretical, yet practical, Data Structures and Algorithms in C++, 4E by experienced author Adam Drosdek highlights the...
  • №80
  • 21,35 МБ
  • добавлен
  • изменен
4th Edition. — Cengage Learning, 2012. — 792 p. — ISBN-10: 1-133-60842-6, ISBN-13: 978-1-133-60842-4. На англ. языке. Strengthen your understanding of data structures and their algorithms for the foundation you need to successfully design, implement and maintain virtually any software system. T heoretical, yet practical, Data Structures and Algorithms in C++ , 4E by...
  • №81
  • 22,24 МБ
  • добавлен
  • изменен
Second Edition. — Course Technology, 2005. — 770 р. Using the Java programming language, author Adam Drozdek highlights three important aspects of data structures and algorithms. First, the book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms' complexity. Second, the book presents data structures in...
  • №82
  • 11,77 МБ
  • добавлен
  • изменен
Издательство Springer, 2012, -450 pp. An approximation algorithm is an efficient algorithm that produces solutions to an optimization problem that are guaranteed to be within a fixed ratio of the optimal solution. Instead of spending an exponential amount of time finding the optimal solution, an approximation algorithmsettles for near-optimal solutions within polynomial time in...
  • №83
  • 3,06 МБ
  • добавлен
  • изменен
New York: Cambridge University Press, 2008. — 472 p. — ISBN 978-0-511-41370-4. There are many algorithm texts that provide lots of well-polished code and proofs of correctness. This book is not one of them. Instead, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. By looking at both the big picture and...
  • №84
  • 6,04 МБ
  • добавлен
  • изменен
Morgan Kaufmann, 2004. — 728 p. — ISBN 9781558607989, 1558607986. Digital arithmetic plays an important role in the design of general-purpose digital processors and of embedded systems for signal processing, graphics, and communications. In spite of a mature body of knowledge in digital arithmetic, each new generation of processors or digital systems creates new arithmetic design...
  • №85
  • 5,51 МБ
  • добавлен
  • изменен
Издательство Morgan Kaufmann, 2004, -555 pp. Слайды, исправления ошибок и решения задач к книге Ercegovac M.D., Lang T. Digital Arithmetic Our main objective in preparing this book is to provide a comprehensive discussion of the main ideas and concepts in digital arithmetic, reflecting both the theory and design aspects, and to help students and practicing engineers develop...
  • №86
  • 2,00 МБ
  • добавлен
  • изменен
Издательство CRC Press, 2015, -318 pp. Recent technological advances in the last two decades have provided availability of enormous amounts of data about large networks consisting of hundreds and thousands of nodes. These so-called complex networks have non-trivial topological features and can vary from technological networks to social networks to biological networks. The study...
  • №87
  • 2,42 МБ
  • добавлен
  • изменен
University of Illinois, 2018. — 448 p. This textbook grew out of a collection of lecture notes that I wrote for various algorithms classes at the University of Illinois at Urbana-Champaign, which I have been teaching about once a year since January 1999. Spurred by changes of our undergraduate theory curriculum, I undertook a major revision of my notes in 2016; this book consists...
  • №88
  • 23,93 МБ
  • добавлен
  • изменен
Springer International Publishing AG, 2018. — 138 p. — (Logic, Argumentation & Reasoning 15). — ISBN 331972973X. This book explains exactly what human knowledge is. The key concepts in this book are structures and algorithms, i.e., what the readers “see” and how they make use of what they see. Thus in comparison with some other books on the philosophy (or methodology) of science,...
  • №89
  • 1,91 МБ
  • добавлен
  • изменен
O'Reilly Media, 2006. — 166 p. — ISBN: 0596100167, 9780596100162 Dashboards have become popular in recent years as uniquely powerful tools for communicating important information at a glance. Although dashboards are potentially powerful, this potential is rarely realized. The greatest display technology in the world won't solve this if you fail to use effective visual design....
  • №90
  • 8,25 МБ
  • добавлен
  • изменен
Издательство Springer, 1998, -455 pp. A workshop on the competitive analysis of on-line algorithms was held at Schloss Dagstuhl (Germany) during the last week of June 1996. Many survey talks were presented at this workshop. We then asked the speakers to prepare survey chapters that covered and extended the contents of their talks. This volume now is the compilation of the...
  • №91
  • 3,46 МБ
  • добавлен
  • изменен
Prentice-Hall. Englewood Cliffs, NJ, USA. 1968. 238 pages. Includes index. ISBN: 0131657208 This book developed from lecture notes for a class that were taught for several years at the IBM Systems Research Institute. This is an eight-week class on mathematical methods used in function evaluation routines for digital computers. This was the first textbook to contain all the...
  • №92
  • 29,62 МБ
  • добавлен
  • изменен
John Wiley & Sons, 1995. - 464 p. ISBN: 0471009555 A practical, step-by-step exposition of the special features of C++ algorithms and how they fit in overall program design. All algorithms in the text and on the accompanying disk have been created from scratch in C++. Methods described in each example are backed up with complete source code and each chapter progresses from...
  • №93
  • 7,18 МБ
  • добавлен
  • изменен
Springer, 2018. — 180 p. — (Frontiers in Mathematics). — ISBN-10 3319952633. The book collects and contributes new results on the theory and practice of ill-posed inverse problems. Different notions of ill-posedness in Banach spaces for linear and nonlinear inverse problems are discussed not only in standard settings but also in situations up to now not covered by the literature....
  • №94
  • 3,77 МБ
  • добавлен
  • изменен
Springer, 2010. — 210 p. — ISBN 978-3-642-16532-0. For a long time computer scientists have distinguished between fast and slow algorithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are...
  • №95
  • 13,75 МБ
  • добавлен
  • изменен
Chandos Publishing, 2008. — 220 p. — (Chandos Information Professional Series). — ISBN: 1843343010, 9781843343011 This book assists information professionals in improving the usability of digital objects by adequately documenting them and using tools for metadata management. It provides practical advice for libraries, archives, and museums dealing with digital collections in a...
  • №96
  • 1,89 МБ
  • добавлен
  • изменен
Wiley, 2012. — 334 p. Big data is the next wave of new data sources that will drive the next wave of analytic innovation in business, government, and academia. These innovations have the potential to radically change how organizations view their business. The analysis that big data enables will lead to decisions that are more informed and, in some cases, different from what they...
  • №97
  • 7,84 МБ
  • добавлен
  • изменен
Springer, 2016. — 205 p. — ISBN 978-3-658-12225-6; ISBN 978-3-658-12224-9. Christian Fürber investigates the useful application of semantic technologies for the area of data quality management. Based on a literature analysis of typical data quality problems and typical activities of data quality management processes, he develops the Semantic Data Quality Management framework as...
  • №98
  • 4,40 МБ
  • добавлен
  • изменен
Springer, 2011. — 793 p. 297 illus. — ISBN: 9781461414155 Data Intensive Computing refers to capturing, managing, analyzing, and understanding data at volumes and rates that push the frontiers of current technologies. The challenge of data intensive computing is to provide the hardware architectures and related software systems and techniques which are capable of transforming...
  • №99
  • 17,39 МБ
  • добавлен
  • изменен
Gabbrielli M., Martini S. Springer; 2010 edition (April 15, 2010). - 460 p. ISBN-10: 1848829132 This self-contained textbook assumes that the reader has some familiarity with one programming language, and adopts a simple yet rigorous approach. The author explains the main programming paradigms (imperative, object-oriented, functional, and logic), and makes clear separation...
  • №100
  • 2,81 МБ
  • добавлен
  • изменен
Books on Demand GmbH, 2019. - 220 p. A technical book about popular space-efficient data structures and fast algorithms that are extremely useful in modern Big Data applications. Probabilistic data structures is a common name for data structures based mostly on different hashing techniques. Unlike regular (or deterministic) data structures, they always provide approximated answers...
  • №101
  • 3,13 МБ
  • добавлен
  • изменен
Springer-Verlag, Berlin, Heidelberg, 2007. — 391 p. — (Texts in Computational Science 4) — ISBN-13: 978354068088 This is a book about a code and about coding. The code is a case study which has been used to teach courses in e-Science at the Australian National University since 2001. Students learn advanced programming skills and techniques in the Java TM language. Above all,...
  • №102
  • 6,48 МБ
  • добавлен
  • изменен
Proceedings of the 6th International for Approximation, Ambleside, UK, August 31st – September 4th, 2009 Conference on Algorithms 319 pages published 2011 This book collects up-to-date papers from world experts in a broad variety of relevant applications of approximation theory, including dynamical systems, multiscale modelling of fluid flow, metrology, and geometric...
  • №103
  • 3,56 МБ
  • дата добавления неизвестна
  • изменен
Course Technology, 2005. — 738 p. This second edition expands upon the solid, practical foundation established in the first edition of the text. A new four-part organizational structure increases the flexibility of the text, and all material is presented in a straightforward manner accompanied by an array of examples and visual diagrams.
  • №104
  • 4,77 МБ
  • добавлен
  • изменен
Springer, 2014. — 290 p. — ISBN: 1461492416 This edited book collects state-of-the-art research related to large-scale data analytics that has been accomplished over the last few years. This is among the first books devoted to this important area based on contributions from diverse scientific areas such as databases, data mining, supercomputing, hardware architecture, data...
  • №105
  • 5,74 МБ
  • добавлен
  • изменен
Cambridge University Press, 2017. — 469 p. — ISBN 978-1-107-19405-2. Property testing is concerned with the design of super-fast algorithms for the structural analysis of large quantities of data. The aim is to unveil global features of the data, such as determining whether the data has a particular property or estimating global parameters. Remarkably, it is possible for decisions...
  • №106
  • 4,75 МБ
  • добавлен
  • изменен
Springer, 2009. – 336 p. – 130 illus., 107 in color – ISBN: 184882405X, 9781848824065 Implicit objects have gained increasing importance in geometric modeling, visualisation, animation, and computer graphics, because their geometric properties provide a good alternative to traditional parametric objects. This book presents the mathematics, computational methods and data...
  • №107
  • 11,42 МБ
  • добавлен
  • изменен
Издательство Springer, 2009, -338 pp. This book presents the mathematics, computational methods and data structures, as well as the algorithms needed to render implicit curves and surfaces. Implicit objects have gained an increasing importance in geometric modelling, visualisation, animation, and computer graphics due to their nice geometric properties which give them some...
  • №108
  • 61,47 МБ
  • добавлен
  • изменен
Second edition, 1991. Includes bibliographical references and index. ISBN 0-201-41607-7 1) Introduction Structure of the chapters Naming of variables Probabilities Asymptotic notation About the programming languages On the code for the algorithms Complexity measures and real timings 2) Basic Concepts Data structure description Algorithm descriptions 3) Searching...
  • №109
  • 3,66 МБ
  • добавлен
  • изменен
CRC Press, 2007. — 1351 p. — ISBN: 1584885505 Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics. Starting with basic approaches, the handbook...
  • №110
  • 12,02 МБ
  • добавлен
  • изменен
N.-Y.: Wiley, 2014. - 800p. Introducing a NEW addition to our growing library of computer science titles, Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are...
  • №111
  • 12,08 МБ
  • добавлен
  • изменен
Wiley, 2015. — 816 p. Introducing a NEW addition to our growing library of computer science titles, Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are expected to...
  • №112
  • 10,93 МБ
  • добавлен
  • изменен
2nd Edition. John Wiley & Sons, Inc., 2011. – 738 pages. This second edition of Data Structures and Algorithms in C++ is designed to provide an introduction to data structures and algorithms, including their design, analysis, and implementation. In terms of curricula based on the IEEE/ACM2001 Computing Curriculum, this book is appropriate for use in the courses CS102 (I/O/B...
  • №113
  • 17,15 МБ
  • добавлен
  • изменен
Wiley, 2014. — 800 p. Introducing a NEW addition to our growing library of computer science titles, Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are expected...
  • №114
  • 12,67 МБ
  • добавлен
  • изменен
Cambridge University Press, 2012. — 515. Pseudo-random sequences are essential ingredients of every modern digital communication system, from cellular telephones to satellite imagery. This book describes the design, mathematical analysis and implementation of pseudo-random sequences. Suitable for graduate students of mathematics or electrical engineering, it also serves as a...
  • №115
  • 2,24 МБ
  • добавлен
  • изменен
Cambridge University Press, 2013. — 299 p. — ISBN: 0521191955, 9780521191951 The world is awash with digital data from social networks, blogs, business, science and engineering. Data-intensive computing facilitates understanding of complex problems that must process massive amounts of data. Through the development of new classes of software, algorithms and hardware, data-intensive...
  • №116
  • 6,44 МБ
  • добавлен
  • изменен
Издательство Springer, 2012, -264 pp. This text, based on a graduate course taught by the authors, introduces the reader to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics as well as a significant amount of recent and more advanced material, sometimes on the edge of current research. Methods based on semidefinite...
  • №117
  • 2,41 МБ
  • добавлен
  • изменен
Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2006, -91 pp. Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redundancy into the data to produce an associated codeword. The redundancy built into the codewords enables...
  • №118
  • 583,72 КБ
  • добавлен
  • изменен
Springer, 2015. — 129 p. — (Lecture Notes in Computer Science). — ISBN: 9783662465615, 9783662465622 Abdelkader Hameurlain, Josef Küng, Roland Wagner, Devis Bianchini, Valeria De Antonellis, Roberto De Virgilio (eds.) The LNCS journal Transactions on Large-Scale Data- and Knowledge-Centered Systems focuses on data management, knowledge discovery, and knowledge processing, which...
  • №119
  • 10,36 МБ
  • добавлен
  • изменен
[Wrox, 2006]. This book aims to explain those algorithms and data structures most commonly encountered in day-today software development, while remaining at all times practical, concise, and to the point, with little or no verbiage to distract from the core concepts and examples.
  • №120
  • 4,91 МБ
  • добавлен
  • изменен
Springer, 2015. — 499 p. — (Studies in Big Data, 9). — ISBN: 9783319110554 Hassanien A.E., Azar A.T., Snasel V., Kacprzyk J., Abawajy J.H. (Eds.) This volume provides challenges and Opportunities with updated, in-depth material on the application of Big data to complex systems in order to find solutions for the challenges and problems facing big data sets applications. Much...
  • №121
  • 16,42 МБ
  • добавлен
  • изменен
Springer, 2015. — 194 p. — ISBN: 9783319150772, 9783319150789 The rapidly progressing digital revolution is now touching the foundations of the governance of societal structures. Humans are on the verge of evolving from consumers to prosumers, and old, entrenched theories – in particular sociological and economic ones – are falling prey to these rapid developments. The original...
  • №122
  • 938,32 КБ
  • добавлен
  • изменен
Packt Publishing, 2015. — 280 p. Learning Object-Oriented Programming is an easy-to-follow guide full of hands-on examples of solutions to common problems with object-oriented code in Python, JavaScript, and C#. It starts by helping you to recognize objects from real-life scenarios and demonstrates that working with them makes it simpler to write code that is easy to understand...
  • №123
  • 2,92 МБ
  • добавлен
  • изменен
Издательство Springer, 2006. 237 стр. Triangles and Triangulations Triangles Triangulations Some Properties of Triangulations A Triangulation Algorithm Edge Insertion Using Triangulations Exercises Graphs and Data Structures Graph Theoretic Concepts Generalized Maps (G-maps) Data Structures for Triangulations A Minimal Triangle-Based Data Structure...
  • №124
  • 8,07 МБ
  • добавлен
  • изменен
Computer Science Press, 1978. – 641 p. – ISBN: 0914894226, 9780914894223 If we try to identify those contributions of computer science which will be long lasting, surely one of these will be the refinement of the concept called algorithm. Ever since man invented the idea of a machine which could perform basic mathematical operations, the study of what can be computed and how it...
  • №125
  • 4,61 МБ
  • добавлен
  • изменен
W.H.Freeman & Co Ltd, 1997. – 777 p. – ISBN: 0716783169, 9780716783169 If we try to identify those contributions of computer science which will be long lasting, surely one of these will be the refinement of the concept called algorithm. Ever since man invented the idea of a machine which could perform basic mathematical operations, the study of what can be computed and how it...
  • №126
  • 5,70 МБ
  • добавлен
  • изменен
Syncfusion Inc, 2012. — 111 p. Categories: General Programming Data Structures Succinctly Part 1 is your first step to a better understanding of the different types of data structures, how they behave, and how to interact with them. Starting with simple linked lists and arrays, and then moving to more complex structures like binary search trees and sets, author Robert Horvick...
  • №127
  • 1,85 МБ
  • добавлен
  • изменен
Syncfusion Inc, 2012. — 116 p. Categories: General Programming Data Structures Succinctly Part 1 is your first step to a better understanding of the different types of data structures, how they behave, and how to interact with them. Starting with simple linked lists and arrays, and then moving to more complex structures like binary search trees and sets, author Robert Horvick...
  • №128
  • 751,75 КБ
  • добавлен
  • изменен
Syncfusion Inc, 2013. — 126 p. Categories: General Programming Data Structures Succinctly Part 2 is your concise guide to skip lists, hash tables, heaps, priority queues, AVL trees, and B-trees. As with the first book, you'll learn how the structures behave, how to interact with them, and their performance limitations. Starting with skip lists and hash tables, and then moving...
  • №129
  • 2,36 МБ
  • добавлен
  • изменен
Syncfusion Inc, 2013. — 137 p. Categories: General Programming Data Structures Succinctly Part 2 is your concise guide to skip lists, hash tables, heaps, priority queues, AVL trees, and B-trees. As with the first book, you'll learn how the structures behave, how to interact with them, and their performance limitations. Starting with skip lists and hash tables, and then moving...
  • №130
  • 1,06 МБ
  • добавлен
  • изменен
Издательство Springer, 2009, -367 pp. The public image of computer science does not reflect its true nature. The general public and especially high school students identify computer science with a computer driving license. They think that studying computer science is not a challenge, and that anybody can learn it. Computer science is not considered a scientific discipline but a...
  • №131
  • 3,48 МБ
  • добавлен
  • изменен
Издательство Springer, 2005, -290 pp. Randomization has become a standard approach in algorithm design. Efficiency and simplicity are the main features of randomized algorithms that often made randomization a miraculous springboard for solving complex problems in various applications. Especially in the areas of communication, cryptography, data management, and discrete...
  • №132
  • 1,64 МБ
  • добавлен
  • изменен
Springer, 2016. — 214 p. — ISBN: 978-3-319-30144-0. This book presents different use cases in big data applications and related practical experiences. Many businesses today are increasingly interested in utilizing big data technologies for supporting their business intelligence so that it is becoming more and more important to understand the various practical issues from...
  • №133
  • 5,90 МБ
  • добавлен
  • изменен
Elsevier, 2015. — 342 p. Today, the world is trying to create and educate data scientists because of the phenomenon of Big Data. And everyone is looking deeply into this technology. But no one is looking at the larger architectural picture of how Big Data needs to fit within the existing systems (data warehousing systems). Taking a look at the larger picture into which Big Data...
  • №134
  • 58,09 МБ
  • добавлен
  • изменен
Springer, 2017. — 272 p. — ISBN 978-3-319-63344-2. This book presents source code modularization as a key activity in reverse engineering to extract the software architecture from the existing source code. To this end, it provides detailed techniques for source code modularization and discusses their effects on different software quality attributes. Nonetheless, it is not a mere...
  • №135
  • 5,99 МБ
  • добавлен
  • изменен
N.-Y.: Springer, 2007. - 387p. Approximation methods are vital in many challenging applications of computational science and engineering. This is a collection of papers from world experts in a broad variety of relevant applications, including pattern recognition, machine learning, multiscale modelling of fluid flow, metrology, geometric modelling, tomography, signal and image...
  • №136
  • 12,10 МБ
  • добавлен
  • изменен
MondAt Kft, 2007. — 579 p. It is a special pleasure for me to recommend to the Readers the book Algorithms of Computer Science, edited with great care by Antal Ivanyi. Computer algorithms form a very important and fast developing branch of computer science. Design and analysis of large computer networks, large scale scienti c computations and simulations, economic planning,...
  • №137
  • 3,94 МБ
  • добавлен
  • изменен
MondAt Kft, 2007. — 573 p. It is a special pleasure for me to recommend to the Readers the book Algorithms of Computer Science, edited with great care by Antal Ivanyi. Computer algorithms form a very important and fast developing branch of computer science. Design and analysis of large computer networks, large scale scienti c computations and simulations, economic planning,...
  • №138
  • 4,93 МБ
  • добавлен
  • изменен
AnTonCom, 2011. — 328 p. This third volume of the algorithm book (volume 1 /file/916180/, volume 2 /file/916182/) contains seven new chapters. The Branch and Bound Method Comparison Based Ranking Complexity of Words Conflict Situations General Purpose Computing on Graphics Processing Units Perfect Arrays Score Sets and Kings
  • №139
  • 2,25 МБ
  • добавлен
  • изменен
Cambridge University Press, 2015. — 390 pages. — ISBN 978-0521876087. How do you distinguish a cat from a dog by their DNA? Did Shakespeare really write all of his plays? Pattern matching techniques can offer answers to these questions and to many others, from molecular biology, to telecommunications, to classifying Twitter content. This book for researchers and graduate students...
  • №140
  • 7,90 МБ
  • добавлен
  • изменен
Cambridge University Press, 2015. — 390 pages. — ISBN 978-0521876087 How do you distinguish a cat from a dog by their DNA? Did Shakespeare really write all of his plays? Pattern matching techniques can offer answers to these questions and to many others, from molecular biology, to telecommunications, to classifying Twitter content. This book for researchers and graduate...
  • №141
  • 5,31 МБ
  • добавлен
  • изменен
Издательство Springer, 2013, -91 pp. This work is a synopsis of research work done by me and my fellow co-investigators in the fields of computer arithmetic and computer architecture spanning a period of over 20 years. During the 1990s, discussion among the computer architects used to be focused on weighing the merits and demerits of control-flow and data-flow models of...
  • №142
  • 525,51 КБ
  • добавлен
  • изменен
CRC Press, 2014. — 236 p. — ISBN-10: 1466589892, ISBN-13: 978-1-4665-8990-2. На англ. языке. A student-friendly text, A Concise Introduction to Data Structures Using Java takes a developmental approach, starting with simpler concepts first and then building toward greater complexity. Important topics, such as linked lists, are introduced gradually and revisited with...
  • №143
  • 1,31 МБ
  • добавлен
  • изменен
Wiley, 2014. — 408 p. — ISBN: 9781118729083 Tap the power of Big Data with Microsoft technologies Big Data is here, and Microsoft's new Big Data platform is a valuable tool to help your company get the very most out of it. This timely book shows you how to use HDInsight along with HortonWorks Data Platform for Windows to store, manage, analyze, and share Big Data throughout...
  • №144
  • 6,42 МБ
  • добавлен
  • изменен
Springer, 2007. — 266 p. The philosophy of just-in-time manufacturing was first introduced by the Japanese automobile producer Toyota in 1950s. This philosophy may be briefly defined as elimination of waste and simultaneous continuous improvement of productivity. There are many different sources of waste in a manufacturing system; therefore, many activities need to be...
  • №145
  • 2,41 МБ
  • добавлен
  • изменен
Wiley, 2014. — 304 p. — ISBN: 1118342321, 9781118342329 Create a competitive advantage with data quality Data is rapidly becoming the powerhouse of industry, but low-quality data can actually put a company at a disadvantage. To be used effectively, data must accurately reflect the real-world scenario it represents, and it must be in a form that is usable and accessible....
  • №146
  • 8,99 МБ
  • добавлен
  • изменен
University Of Chicago Press, 2014. — 328 p. — ISBN-13 978-0226002736. These days, we take for granted that our computer screens—and even our phones—will show us images in vibrant full color. Digital color is a fundamental part of how we use our devices, but we never give a thought to how it is produced or how it came about. Chromatic Algorithms reveals the fascinating history...
  • №147
  • 104,15 МБ
  • добавлен
  • изменен
5th Edition. — CareerMonk Publications, 2017. — 828 p. — ISBN 9788192107547 "Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer...
  • №148
  • 32,74 МБ
  • добавлен
  • изменен
New York: CareerMonk Publications, 2017. — 868 p. "Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. A handy guide of...
  • №149
  • 32,74 МБ
  • добавлен
  • изменен
2nd edition. — CareerMonk Publications, 2017. — 450 р. — ISBN 978-8192107554. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy in Java: Data Structure And Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the...
  • №150
  • 35,73 МБ
  • добавлен
  • изменен
5th Edition. — CareerMonk Publications, 2017. — 828 p. — ISBN 9788192107547. "Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists....
  • №151
  • 52,99 МБ
  • добавлен
  • изменен
CareerMonk Publications, 2017. — 828 p. — ISBN 9788192107547. — 5th Edition. "Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer...
  • №152
  • 55,86 МБ
  • добавлен
  • изменен
5th edition. — CareerMonk Publications, 2017. — 828 p. — ISBN 9788192107547. "Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists....
  • №153
  • 55,85 МБ
  • добавлен
  • изменен
Wiley, 1984. — 239 p. This book provides an introduction to the analysis of particular algorithms. It has its origin in lecture courses given at the Universitat des Saarlandes, Saarbrucken in 1980 and attheJohann Wolfgang Goethe-Universitat Frankfurta.M. in 1982. The material can be covered in a one-semester course. In preparing the notes for publication as a book, I have added a...
  • №154
  • 1,92 МБ
  • добавлен
  • изменен
McGraw-Hill Osborne Media, 2004. – 301 p. – ISBN: 0072253592 The fast and easy way to understanding the fundamentals of data structures If you’ve been searching for that quick, easy-to-understand guide to walk you through data structures, look no further. Data Structures Demystified is all these things and more. Whether you’re trying to program stacks and linked lists or...
  • №155
  • 3,13 МБ
  • добавлен
  • изменен
CRC Press, 2009. – 379 p. – ISBN: 0849328802, 9780849328800 Data flow analysis is used to discover information for a wide variety of useful applications, ranging from compiler optimizations to software engineering and verification. Modern compilers apply it to produce performance-maximizing code, and software engineers use it to re-engineer or reverse engineer programs and...
  • №156
  • 3,45 МБ
  • добавлен
  • изменен
O'Reilly Media, 2017. — 370 p. — ISBN 978-1449334833. Final Release On the surface, design practices and data science may not seem like obvious partners. But these disciplines actually work toward the same goal, helping designers and product managers understand users so they can craft elegant digital experiences. While data can enhance design, design can bring deeper meaning to...
  • №157
  • 4,26 МБ
  • добавлен
  • изменен
O'Reilly Media, 2017. — 370 p. — ISBN 978-1449334833. Final Release On the surface, design practices and data science may not seem like obvious partners. But these disciplines actually work toward the same goal, helping designers and product managers understand users so they can craft elegant digital experiences. While data can enhance design, design can bring deeper meaning to...
  • №158
  • 2,45 МБ
  • добавлен
  • изменен
Amazon, Netflix, Google, and Facebook have used data-driven design techniques to improve the user experience of their consumer products. With this book, you'll learn how improve your design decisions through data-driven A/B testing, and how you can apply this process to everything from small design tweaks to large-scale UX concepts. Want to determine if a new color will improve...
  • №159
  • 1,42 МБ
  • добавлен
  • изменен
SAGE Publications Ltd., 2014. — 285 p. Given the relatively early point in the present data revolution, it is not at all certain how the present transformations will unfold and settle, and what will be the broader consequences of changes taking place. What is clear is that there is an urgent need to try and make sense of what is happening. Thus, the aim of this book is to provide...
  • №160
  • 5,06 МБ
  • добавлен
  • изменен
Springer, 2016. — 428 p. — (Lecture Notes in Computer Science). — ISBN 10 3319494864. — ISBN 13 978-3319494869. Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical...
  • №161
  • 11,05 МБ
  • добавлен
  • изменен
Knowledge flow, 2015. — 50 p. — ASIN: B00U47EHEE Data Structures is a study or a technique used to understand how to store a bunch of data in an organized manner, so it can be used in a very sophisticated manner for designing of programs and algorithms. Contents: Introduction Data structure for string and pattern matching Algorithm Arrays and Pointers Linked Lists...
  • №162
  • 1,11 МБ
  • добавлен
  • изменен
Stanford: CLSI, 2010. — 469 p. Table of contents : Robert W Floyd, in Memoriam he Bose-Nelson Sorting Problem A One-Way, Stackless Quicksort Algorithm Optimum Binary Search Trees Dynamic Huffman Coding Inhomogeneous Sorting Lexicographic Permutations with Restrictions Nested Satisfiability Fast Pattern Matching in Strings Addition Machines A Simple Program Whose...
  • №163
  • 8,18 МБ
  • добавлен
  • изменен
Springer, 2000. — 399 p. This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial...
  • №164
  • 9,24 МБ
  • добавлен
  • изменен
A K Peters, 2002. — 292 p. This text explains the fundamental principles of algorithms available for performing arithmetic operations on digital computers. These include basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems as well as more complex operations such as square root extraction and...
  • №165
  • 2,50 МБ
  • добавлен
  • изменен
Издательство A K Peters, 2002, -292 pp. This text explains the fundamental principles of algorithms available for performing arithmetic operations on digital computers. These include basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems as well as more complex operations such as square root extraction...
  • №166
  • 9,91 МБ
  • добавлен
  • изменен
New York: Springer-Verlag, 1992. — 320 р. The design and analysis of algorithms is one of the two essential cornerstone topics in computer science (the other being automata theory/theory of computation). Every computer scientist has a copy of Knuth's works on algorithms on his or her shelf. Dexter Kozen, a researcher and professor at Cornell University, has written a text for...
  • №167
  • 1,64 МБ
  • добавлен
  • изменен
CRC Press, 2015. — 478 p. — EISBN: 9781482240566 This timely book edited by Kuan-Ching Li, Hai Jiang, Laurence T. Yang, and Alfredo Cuzzocrea gives a quick introduction to the understanding and use of Big Data and provides examples and insights into the process of handling and analyzing problems. It presents introductory concepts as well as complex issues. The book has five major...
  • №168
  • 51,79 МБ
  • добавлен
  • изменен
Sams, 1999. — 523 р. — (Sams Teach Yourself...in 24 Hours). — ISBN 978-0672316333. This book is about data structures and algorithms as used in computer programming. Data structures are ways in which data is arranged in your computer’s memory (or stored on disk). Algorithms are the procedures a software program uses to manipulate the data in these structures. Almost every...
  • №169
  • 15,16 МБ
  • добавлен
  • изменен
Springer, 2003. — 301. Our work is intended to be a reference book for researchers and practitioners interested in gaining in-depth understanding of scatter search with the goal of expanding this methodology or applying it to solving difficult practical problems. The book could also be used to complement other materials in a graduate seminar on metaheuristic optimization. We...
  • №170
  • 6,31 МБ
  • добавлен
  • изменен
Springer, 2014. — 116 p. — (Advances in Intelligent Systems and Computing). — ISBN: 3319055267, 9783319055275 Big data is an essential key to build a smart world as a meaning of the streaming, continuous integration of large volume and high velocity data covering from all sources to final destinations. The big data range from data mining, data analysis and decision making, by...
  • №171
  • 3,29 МБ
  • добавлен
  • изменен
Addison Wesley, 2011, ISBN 0132316811, 592 pages. Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal...
  • №172
  • 2,36 МБ
  • добавлен
  • изменен
Addison-Wesley, 1991. – 524 p. – ISBN: 067339736X, 9780673397362 Using only practically useful techniques, this book teaches methods for organizing, reorganizing, exploring, and retrieving data in digital computers, and the mathematical analysis of those techniques. The authors present analyses that are relatively brief and non-technical but illuminate the important performance...
  • №173
  • 2,83 МБ
  • добавлен
  • изменен
HarperCollins, 1991. – 524 p. – ISBN 0-673-39736-X. Using only practically useful techniques, this book teaches methods for organizing, reorganizing, exploring, and retrieving data in digital computers, and the mathematical analysis of those techniques. The authors present analyses that are relatively brief and non-technical but illuminate the important performance characteristics...
  • №174
  • 24,87 МБ
  • добавлен
  • изменен
Springer Science+Business Media, 2014. — 161 p. — (SpringerBriefs in Mathematics) — ISBN 1493907476. The Compressed Word Problem for Groups provides a detailed exposition of known results on the compressed word problem, emphasizing efficient algorithms for the compressed word problem in various groups. The author presents the necessary background along with the most recent...
  • №175
  • 1,42 МБ
  • добавлен
  • изменен
Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2006, -78 pp. This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains...
  • №176
  • 446,92 КБ
  • добавлен
  • изменен
Cambridge University Press, 2011. — 250 p. — ISBN: 9780511794292, 9781107005570 Need to get up to speed quickly on the latest advances in high performance data converters? Want help choosing the best architecture for your application? With everything you need to know about the key new converter architectures, this guide is for you. It presents basic principles, circuit and...
  • №177
  • 2,54 МБ
  • добавлен
  • изменен
Springer, 2012. — 260. Data Approximation by Low-complexity Models details the theory, algorithms, and applications of structured low-rank approximation. Efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. Much of the text is devoted to describing the applications of the theory...
  • №178
  • 1,91 МБ
  • добавлен
  • изменен
Wiley, 2015. — 256 p. — ISBN 978-1-118-96583-2. Convert the promise of big data into real world results There is so much buzz around big data. We all need to know what it is and how it works – that much is obvious. But is a basic understanding of the theory enough to hold your own in strategy meetings? Probably. But what will set you apart from the rest is actually knowing how...
  • №179
  • 4,82 МБ
  • добавлен
  • изменен
Wiley, 2015. — 256 p. — ISBN 978-1-118-96583-2. Convert the promise of big data into real world results There is so much buzz around big data. We all need to know what it is and how it works – that much is obvious. But is a basic understanding of the theory enough to hold your own in strategy meetings? Probably. But what will set you apart from the rest is actually knowing how...
  • №180
  • 2,77 МБ
  • добавлен
  • изменен
Manning, 2015. — 330 p. — ISBN: 9781617290343 Big Data teaches you to build big data systems using an architecture that takes advantage of clustered hardware along with new tools designed specifically to capture and analyze web-scale data. It describes a scalable, easy-to-understand approach to big data systems that can be built and run by a small team. Following a realistic...
  • №181
  • 7,41 МБ
  • добавлен
  • изменен
ПОПЫТКА ДОСТИЖЕНИЯ СОВЕРШЕННОГО РЕЗУЛЬТАТА ПРИ АППРОКСИМАЦИИ КРИВЫХ БЕЗЬЕ КУСОЧНО-ЛИНЕЙНЫМ СПОСОБОМ. Предисловие. Способ прямых вычислений. Недостатки способа. Paul de Casteljau разделяет и властвует (рулит, в общем). Оценка ошибки отклонения. Оценка угловой ошибки. Обработка точек перегиба. Дьявол кроется в деталях. Коллинеарный случай. Полный код. Квадратические...
  • №182
  • 605,18 КБ
  • дата добавления неизвестна
  • изменен
Jones & Bartlett Learning, 2001. — 314 p. — ISBN: 0763716340, 9780763716349 McConnell (Canisius College) developed this course to make students aware of the impact of algorithms on a program's efficiency and instruct them in the skills to analyze algorithms used in programs. Students learn the basics of analysis; searching, selecting, and sorting algorithms; and the element
  • №183
  • 2,21 МБ
  • добавлен
  • изменен
Springer, 1984. — 917. The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3:...
  • №184
  • 14,08 МБ
  • добавлен
  • изменен
Издательство Springer, 2008, -305 pp. Algorithms are at the heart of every nontrivial computer application. Therefore every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and generic techniques for modeling, understanding, and...
  • №185
  • 2,96 МБ
  • добавлен
  • изменен
Springer-Verlag, Berlin, Heidelberg, 2008. — 305. — ISBN: 3642096824 Algorithms are at the heart of every nontrivial computer application. Therefore every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and generic techniques for...
  • №186
  • 4,68 МБ
  • добавлен
  • изменен
Chapman and Hall/CRC, 2018. — 1120 p. The Handbook of Data Structures and Applications was first published over a decade ago. This second edition aims to update the first by focusing on areas of research in data structures that have seen significant progress. While the discipline of data structures has not matured as rapidly as other areas of computer science, the book aims to...
  • №187
  • 37,58 МБ
  • добавлен
  • изменен
CRC Press, 2014. — 259 p. — EISBN: 9781498726528 Digital Humanitarians examines how new uses of technology and vast quantities of digital data are transforming the way societies prepare for, respond to, cope with, and ultimately understand humanitarian disasters. There was a time when humanitarian response was the purview of an elite, hardened set of type A personalities...
  • №188
  • 4,76 МБ
  • добавлен
  • изменен
Springer, 1998. - 387 pages. 3rd Edition. ISBN 3540606769, 9783540606765 Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, such as optimization of functions with linear and nonlinear constraints, the traveling...
  • №189
  • 16,24 МБ
  • добавлен
  • изменен
New York: Springer-Verlag, 1992. — 360 р. A text for a graduate course in mathematics, for students with at least some basic knowledge of set theory, rational integers, combinatorics (Newton is sufficient), and elementary analysis and algebra.
  • №190
  • 2,54 МБ
  • добавлен
  • изменен
Cengage Learning, 2012. – 448 p. – 3rd ed. – ISBN: 1133366805, 9781133366805 Equip yourself for success with a state-of-the-art approach to algorithms available only in Miller/Boxer's Algorithms Sequential & Parallel: A Unified Approach, 3E. This unique and functional text gives you an introduction to algorithms and paradigms for modern computing systems, integrating the study...
  • №191
  • 15,82 МБ
  • добавлен
  • изменен
A Bradford Book The MIT Press Cambridge, Massachusetts London, England Fifth printing, 1999. - 158 c. Genetic Algorithms: An Overview Genetic Algorithms in Problem Solving Genetic Algorithms in Scientific Models Theoretical Foundations of Genetic Algorithms Conclusions and Future Directions
  • №192
  • 6,20 МБ
  • дата добавления неизвестна
  • изменен
AMACOM American Management Association, 2001. ISBN: 0-8144-0588-6. Язык: Английский. Turn to this book to learn to manage mountains of data through distributed data warehousing techniques.
  • №193
  • 2,78 МБ
  • добавлен
  • изменен
Springer, 2002. — 275 p. — ISBN: 1461353122, 9781461353126 Compression and Coding Algorithms describes in detail the coding mechanisms that are available for use in data compression systems. The well known Huffman coding technique is one mechanism, but there have been many others developed over the past few decades, and this book describes, explains and assesses them. People...
  • №194
  • 18,31 МБ
  • добавлен
  • изменен
Springer, 2015. — 184 p. — (Studies in Big Data). — ISBN: 8132224930, 9788132224938 This book is a collection of chapters written by experts on various aspects of big data. The book aims to explain what big data is and how it is stored and used. The book starts from the fundamentals and builds up from there. It is intended to serve as a review of the state-of-the-practice in...
  • №195
  • 6,99 МБ
  • добавлен
  • изменен
Apress, 2013. — 310 p. — ISBN: 1430248726, 9781430248729 Big Data Imperatives, focuses on resolving the key questions on everyone’s mind: Which data matters? Do you have enough data volume to justify the usage? How you want to process this amount of data? How long do you really need to keep it active for your analysis, marketing, and BI applications? Big data is emerging from...
  • №196
  • 9,71 МБ
  • добавлен
  • изменен
Springer, 1992. — 397. The German Science Foundation (Deutsche Forschungsgemeinschaft, DFG) started a special joint intiative (Schwerpunktprogramm) entitled "Datenstrukturen und effiziente Algorithmen" in 1986. The aim of the initiative was to encourage collaborative research on algorithms, a central concept in computer science. For a period of five years about a dozen projects...
  • №197
  • 7,00 МБ
  • добавлен
  • изменен
Springer, 1992. — 397. The German Science Foundation (Deutsche Forschungsgemeinschaft, DFG) started a special joint intiative (Schwerpunktprogramm) entitled "Datenstrukturen und effiziente Algorithmen" in 1986. The aim of the initiative was to encourage collaborative research on algorithms, a central concept in computer science. For a period of five years about a dozen projects...
  • №198
  • 3,96 МБ
  • добавлен
  • изменен
Wiley, 2016. — 171 p. The world has become digital and technological advances have multiplied circuits with access to data, their processing and their diffusion. New technologies have now reached a certain maturity. Data are available to everyone, anywhere on the planet. The number of Internet users in 2014 was 2.9 billion or 41% of the world population. The need for knowledge is...
  • №199
  • 6,36 МБ
  • добавлен
  • изменен
IGI Global, 2012. — 354 p. In a global and highly-competitive world, organizations face an increasingly difficult environment, with increasing economic pressure and customer demands for more complex products and services that are inexpensive and that can be provided at short notice. In relation to this, hybrid algorithms could play an important role in helping organizations...
  • №200
  • 3,59 МБ
  • добавлен
  • изменен
AU Press, 2013. — 344 p. — ISBN: 1927356385, 9781927356388 Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast,...
  • №201
  • 4,38 МБ
  • добавлен
  • изменен
AU Press, 2013. — 344 p. — ISBN: 978-1-92735638-8. Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical,...
  • №202
  • 2,16 МБ
  • добавлен
  • изменен
Independently published, 2018. — 335 p. — ISBN 1981017232, 9781981017232. This is a print companion to the Massive Open Online Course (MOOC), Data Structures: An Active Learning Approach (https://www.edx.org/course/data-structures-an-active-learning-approach), which utilizes the Active Learning approach to instruction, meaning it has various activities embedded throughout to help...
  • №203
  • 13,66 МБ
  • добавлен
  • изменен
Cambridge University Press, 1995. — 489 p. This book presents the basic concepts in the design and analysis of randomized algorithms at a level accessible to advanced undergraduates and to graduate students. We expect it will also prove to be a reference to professionals wishing to implement such algorithms and to researchers seeking to establish new results in the area. We...
  • №204
  • 7,76 МБ
  • добавлен
  • изменен
Cambridge University Press, 1995. — 489 p. This book presents the basic concepts in the design and analysis of randomized algorithms at a level accessible to advanced undergraduates and to graduate students. We expect it will also prove to be a reference to professionals wishing to implement such algorithms and to researchers seeking to establish new results in the area. We...
  • №205
  • 3,89 МБ
  • добавлен
  • изменен
New Edition. — Amazon Digital Services LLC, — 359 р. — ASIN B07MRB762Z. Introduction to Data Structures and Algorithms in Java, 2019 Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a...
  • №206
  • 3,08 МБ
  • добавлен
  • изменен
New Edition. — Amazon Digital Services LLC, — 359 р. — ASIN B07MRB762Z. Introduction to Data Structures and Algorithms in Java, 2019 Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a...
  • №207
  • 1,88 МБ
  • добавлен
  • изменен
New Edition. — Amazon Digital Services LLC, — 359 р. — ASIN B07MRB762Z. Introduction to Data Structures and Algorithms in Java, 2019 Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a...
  • №208
  • 1,00 МБ
  • добавлен
  • изменен
John Wiley & Sons, Inc., 2017. — 430 p. — (For Dummies). — ISBN 9781119330493. Discover how algorithms shape and impact our digital world. All data, big or small, starts with algorithms. Algorithms are mathematical equations that determine what we see—based on our likes, dislikes, queries, views, interests, relationships, and more—online. They are, in a sense, the electronic...
  • №209
  • 5,74 МБ
  • добавлен
  • изменен
John Wiley & Sons, Inc., 2017. — 430 p. — (For Dummies). — ISBN 9781119330493. Discover how algorithms shape and impact our digital world. All data, big or small, starts with algorithms. Algorithms are mathematical equations that determine what we see—based on our likes, dislikes, queries, views, interests, relationships, and more—online. They are, in a sense, the electronic...
  • №210
  • 1,72 МБ
  • добавлен
  • изменен
Издательство Springer, 2010, -526 pp. The systematic development of efficient algorithms has become a key technology for all kinds of ambitious and innovative computer applications. With major parts of algorithmic theory and algorithmic practice developing in different directions since the 1970s a group of leading researchers in the field started about 15 years ago to coin the...
  • №211
  • 3,29 МБ
  • добавлен
  • изменен
Philadelphia: SIAM, 2008. - 268p. The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation, tuning, and experimental evaluation of algorithms and data structures. ALENEX 2008, the tenth workshop in this series, was held in San Francisco,...
  • №212
  • 2,48 МБ
  • добавлен
  • изменен
Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2008, -120 pp. In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years,...
  • №213
  • 577,80 КБ
  • добавлен
  • изменен
O’Reilly Media, 2013. — 169 p. — ISBN: 1449358721, 9781449358723 There is an easier way to build Hadoop applications. With this hands-on book, you’ll learn how to use Cascading, the open source abstraction framework for Hadoop that lets you easily create and manage powerful enterprise-grade data processing applications—without having to learn the intricacies of MapReduce....
  • №214
  • 12,54 МБ
  • добавлен
  • изменен
Cambridge University Press, 2016. — 574 p. — ISBN 978-1-107-15238-0. Compact data structures help represent data in reduced space while allowing it to be queried, navigated, and operated in compressed form. They are essential toolsfor efficiently handling massive amounts of data by exploiting the memory hierarchy. They also reduce the resources needed in distributed deployments...
  • №215
  • 12,39 МБ
  • добавлен
  • изменен
Издательство Cambridge University Press, 2002, -220 pp. String matching problems range from the relatively simple task of search a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information...
  • №216
  • 6,66 МБ
  • добавлен
  • изменен
Paperback: 557 pages Publisher: M&T Books; 2 Pap/Dsk edition (April 1995) Language: English ISBN-10: 1558514341 ISBN-13: 978-1558514348 Product Dimensions: 9.4 x 7.1 x 1.5 inches Shipping Weight: 1.8 pounds Why This Book Is For You If you want to learn how programs like PKZIP and LHarc work, this book is for you. The compression techniques used in these programs are...
  • №217
  • 1,89 МБ
  • дата добавления неизвестна
  • изменен
Издательство Prentice-Hall, 1993, -365 pp. This book aims to be a challenging introduction to computer science of unconventional coverage and style. Let us explain its prerequisites and aims, so that the reader may judge whether it matches his or her background and goals. This is not a beginner's introduction to programming. We assume that the reader has mastered a high-level...
  • №218
  • 14,16 МБ
  • добавлен
  • изменен
Это - научное исследование компании Numenta. Детально описывает новые алгоритмы обучения и предсказания состояний, разработанные в компании Numenta в 2010 году. Эти новые алгоритмы описаны здесь достаточно детально, чтобы программисты смогли их полностью понять и, по желанию, самостоятельно имплементировать. Существует множество вещей, которые люди делают очень легко, а...
  • №219
  • 1,18 МБ
  • добавлен
  • изменен
Издательство Oxford University Press, 2000, -510 pp. Advances in computer architecture over the past two decades have allowed the performance of digital computer hardware to continue its exponential growth, despite increasing technological difficulty in speed improvement at the circuit level. This phenomenal rate of growth, which is expected to continue in the near future,...
  • №220
  • 26,13 МБ
  • добавлен
  • изменен
Leanpub, 2015. — 219 p. This book describes the process of analyzing data in simple and general terms. The authors have extensive experience both managing data analysts and conducting their own data analyses, and this book is a distillation of their experience in a format that is applicable to both practitioners and managers in data science.
  • №221
  • 3,21 МБ
  • добавлен
  • изменен
Leanpub, 2015. — 162 p. This book describes the process of analyzing data in simple and general terms. The authors have extensive experience both managing data analysts and conducting their own data analyses, and this book is a distillation of their experience in a format that is applicable to both practitioners and managers in data science.
  • №222
  • 6,22 МБ
  • добавлен
  • изменен
Springer, 1993. — 209. Historically, computer security is related to both cryptography and access control in operating systems. Cryptography, although mostly applied in the military and diplomacy, was used to protect communication channels and storage facilities (especially the backups). In the seventies there was a breakthrough in cryptography - the invention of public-key...
  • №223
  • 1,21 МБ
  • добавлен
  • изменен
2nd Edition. — John Wiley & Sons, Inc., Hoboken, New Jersey, Canada, 2017. — 329 p. — ISBN: 978-1-119-32763-9 Your ticket to breaking into the field of data science! Jobs in data science are projected to outpace the number of people with data science skills—making those with the knowledge to fill a data science position a hot commodity in the coming years. Data Science For Dummies...
  • №224
  • 10,32 МБ
  • добавлен
  • изменен
Wiley, 2015. — 410 p. — ISBN: ISBN: 1118841557, 9781118841556, 9781118841525 Discover how data science can help you gain in-depth insightinto your business - the easy way! Jobs in data science abound, but few people have the datascience skills needed to fill these increasingly important roles inorganizations. Data Science For Dummies is the perfectstarting point for IT...
  • №225
  • 20,74 МБ
  • добавлен
  • изменен
Wiley, 2015. — 438 p. — ISBN: 1118841557, 9781118841556 Discover how data science can help you gain in-depth insightinto your business - the easy way! Jobs in data science abound, but few people have the datascience skills needed to fill these increasingly important roles inorganizations. Data Science For Dummies is the perfectstarting point for IT professionals and students...
  • №226
  • 9,25 МБ
  • добавлен
  • изменен
MIT Press, 2006. — 240 p. — ISBN 9780262122870; ISBN 9780262513357; ISBN 9780262252645. All organizations today confront data quality problems, both systemic and structural. Neither ad hoc approaches nor fixes at the systems leve—installing the latest software or developing an expensive data warehouse—solve the basic problem of bad data quality practices. Journey to Data Quality...
  • №227
  • 2,93 МБ
  • добавлен
  • изменен
Pws Pub Co., 1995. — 672 p. — ISBN: 0314045740, 9780314045744 This book is one of the worst text books I have ever used! It is not worth the space it takes up let alone the trees which were ruthlessly massacred to create its pages. In fact, I would like to see the book converted to pure energy in some giant nuclear explosion and fed slowly to a black hole. The following...
  • №228
  • 8,15 МБ
  • добавлен
  • изменен
Marcel Dekker, 2000. — 315 p. The theory of controlled Markov chains originated several years ago in the work of Bellman and other investigators. This theory has seen a tremendous growth in the last decade. In fact, several engineering and theoretical problems can be modelled or rephrased as controlled Markov chains. These problems cover a very wide range of applications in the...
  • №229
  • 6,09 МБ
  • добавлен
  • изменен
Computer Science Press, 1992. — 553 p. — ISBN 0-7167-8243-X. Compared to what? covers all the basics of algorithm analysis but it does not just supply algorithms to memorize - it lets you guide your students through the process of breaking down and solving aigolithmic problems. The invaluable analytic skills developed through this innovative approach will appiv to anj, programming...
  • №230
  • 23,07 МБ
  • добавлен
  • изменен
Издательство John Wiley, 1996, -367 pp. The last few decades have been an exciting time for those of us working in optimisation. The theoretical foundations of complexity have been laid starting with Cook's theorem in the seventies and followed by a plethora of results on NP-Completeness and the definition of yet more complexity classes. Added to this, we have had remarkable...
  • №231
  • 2,89 МБ
  • добавлен
  • изменен
Franklin, Beedle & Associates, 2009. — 583 p. — ISBN: 1590282337, 9781590282335 This book is intended for use in a traditional college-level data structures course (commonly known as CS2). This book assumes that students have learned the basic syntax of Python and been exposed to the use of existing classes. Most traditional CS1 courses that use Python will have covered all the...
  • №232
  • 4,14 МБ
  • добавлен
  • изменен
Amazon Digital Services LLC, 2016. — 85 p. — ASIN: B01CBGW8KA The Ultimate Beginners Crash Course To Understanding And Interpreting Big Data! Data Mining & Data Analytics For improved Business Performance, Life Decisions & More! Are You Ready To Learn How To Understand SMART Big Data, Data Mining & Data Analytics For improved Business Performance, Life Decisions & More? If So...
  • №233
  • 401,52 КБ
  • добавлен
  • изменен
Springer, 2013. — 440 p. — ISBN: 3642362567, 9783642362569 The issue of data quality is as old as data itself. However, the proliferation of diverse, large-scale and often publically available data on the Web has increased the risk of poor data quality and misleading data interpretations. On the other hand, data is now exposed at a much more strategic level e.g. through...
  • №234
  • 6,43 МБ
  • добавлен
  • изменен
Springer, 2016. — 111 p. — ISBN: 9783319387758 This book provides readers the “big picture” and a comprehensive survey of the domain of big data processing systems. For the past decade, the Hadoop framework has dominated the world of big data processing, yet recently academia and industry have started to recognize its limitations in several application domains and big data...
  • №235
  • 4,52 МБ
  • добавлен
  • изменен
Springer, 2010. — 1369 p. — 5th ed. — ISBN: 1848829027, 9781848829022 Data compression is such an important tool in modern computing that some researchers even suggest that all computing is compression! This comprehensive fifth edition of David Salomon’s highly successful reference, Data Compression, now fully reconceived under its new title, Handbook of Data Compression, is...
  • №236
  • 14,29 МБ
  • добавлен
  • изменен
Morgan Kaufmann, 2006. – 1022 p. – ISBN: 0123694469, 9780123694461 The field of multidimensional data structures is large and growing very quickly. Here, for the first time, is a thorough treatment of multidimensional point data, object and image-based representations, intervals and small rectangles, and high-dimensional datasets. The book includes a thorough introduction; a...
  • №237
  • 7,55 МБ
  • добавлен
  • изменен
Apress, 2013. — 157 p. The book provides an insight into heterogeneous infrastructures, databases, and visualization and analytics tools used for realizing the architectures of big data solutions. Its problem-solution approach helps in selecting the right architecture to solve the problem at hand. In the process of reading through these problems, you will learn harness the power...
  • №238
  • 7,02 МБ
  • добавлен
  • изменен
5th Edition. — Morgan Kaufmann, 2018. — 770 p. — ISBN 978-0-12-809474-7. This book, Fifth Edition, builds on the success of what is widely considered the best introduction and reference text on the art and science of data compression. Data compression techniques and technology are ever-evolving with new applications in image, speech, text, audio and video. This new edition...
  • №239
  • 11,81 МБ
  • добавлен
  • изменен
Morgan Kaufmann, 2012. — 768 p. — 4th ed. — ISBN: 0124157963, 9780124157965 Each edition of Introduction to Data Compression has widely been considered the best introduction and reference text on the art and science of data compression, and the fourth edition continues in this tradition. Data compression techniques and technology are ever-evolving with new applications in...
  • №240
  • 17,48 МБ
  • добавлен
  • изменен
Springer, 2008. — 259 p. Introduction Introductory Notions Compositionality Random Bag Preservation and Isolated Subsets BasicMOQA Operations Average-CaseTime of BasicMOQA Operations Joint with D. Early TheMOQA Language Examples ofMOQA Programs Average-CaseAnalysis ofMOQA programs Distri-Track Joint with D. Hickey and M. Boubekeur Conclusion and FutureWork
  • №241
  • 2,55 МБ
  • добавлен
  • изменен
Wiley, 2016. — 400 p. — ISBN: 1119181119, 9781119181118 Integrate big data into business to drive competitive advantage and sustainable success Big Data MBA brings insight and expertise to leveraging big data in business so you can harness the power of analytics and gain a true business advantage. Based on a practical framework with supporting methodology and hands-on...
  • №242
  • 8,76 МБ
  • добавлен
  • изменен
O'Reilly Media, 2013. — 405 p. — ISBN: 1449358659 O'Reilly MediaNow that people are aware that data can make the difference in an election or a business model, data science as an occupation is gaining ground. But how can you get started working in a wide-ranging, interdisciplinary field that’s so clouded in hype? This insightful book, based on Columbia University’s Introduction...
  • №243
  • 27,07 МБ
  • добавлен
  • изменен
Morgan Kaufmann, 2013. – 404 p. – ISBN: 9780123970336 "The Data Quality Assessment Framework" shows you how to measure and monitor data quality, ensuring quality over time. You'll start with general concepts of measurement and work your way through a detailed framework of more than three dozen measurement types related to five objective dimensions of quality: completeness,...
  • №244
  • 6,36 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN: 032190575X, 9780321905758. – 2nd edition. "[Sedgewick and Flajolet] are not only worldwide leaders of the field, they also are masters of exposition. I am sure that every serious computer scientist will find this book rewarding in many ways." —From the Foreword by Donald E. Knuth Despite growing interest, basic information on...
  • №245
  • 6,64 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №246
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №247
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №248
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №249
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №250
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №251
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №252
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №253
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №254
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №255
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №256
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №257
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №258
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №259
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №260
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №261
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №262
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №263
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. – 592 p. – ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №264
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №265
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №266
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №267
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №268
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №269
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №270
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №271
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №272
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №273
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №274
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №275
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №276
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №277
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №278
  • 200,00 МБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 592 p. — ISBN 9780321905758. Видео к книге Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organizes and presents that knowledge, fully introducing...
  • №279
  • 21,07 МБ
  • добавлен
  • изменен
Addison-Wesley, 2011. - 976 p. - ISBN: 032157351X (4th Edition) A Classic Reference The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty...
  • №280
  • 45,47 МБ
  • добавлен
  • изменен
China Machine Press, 2006 - 492 pp.; ISBN ISBN 978-7-111-18606-0 Оригинальное издание: Addison-Wesley Professional, 1995; ISBN 978-0-201-40009-0 1st edition. This book is a thorough overview of the primary techniques and models used in the mathematical analysis of algorithms. The first half of the book draws upon classical mathematical material from discrete mathematics,...
  • №281
  • 9,50 МБ
  • добавлен
  • изменен
4th Edition. — Addison-Wesley, 2011. — 969 p. — ISBN 032157351X. Essential Information about Algorithms and Data Structures A Classic Reference The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph...
  • №282
  • 12,64 МБ
  • добавлен
  • изменен
Addison Wesley, 1984. — 552 p. Pascal, Euclid’s Algorithm, Recursion, Analysis of Algorithms. Implementing Algorithms. Mathematical Algorithms. . Arithmetic. Polynomials, Matrices, Data Structures. Random Numbers. Applications, Linear Congruential Method, Additive. Congruential Method, Testing Randomness, Implementation Notes. Polynomials. Evaluation, Interpolation,...
  • №283
  • 3,85 МБ
  • дата добавления неизвестна
  • изменен
3rd ed. — Addison-Weasley Professional, 2001. — 550 p. — ISBN 9780768685329. A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with...
  • №284
  • 8,17 МБ
  • добавлен
  • изменен
3rd ed. — Addison-Weasley, 1997. — 702 p. — ISBN-13 978-0201314526; ISBN-10 0201314525. Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs) than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations...
  • №285
  • 34,23 МБ
  • добавлен
  • изменен
3rd ed. — Addison-Weasley, 2001. — 528 p. Algorithms in C++, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's...
  • №286
  • 10,86 МБ
  • добавлен
  • изменен
3rd ed. — Addison-Weasley, 1998. — 752 p. — ISBN-10 0-201-35088-2 This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the...
  • №287
  • 5,82 МБ
  • добавлен
  • изменен
Prentice Hall, 2010. – 620 p. – 3rd ed. – ISBN: 0136609112, 9780136609117 This book is intended as a teaching text. I believe it is more important for a practitioner to understand the principles required to select or design the data structure that will best solve some problem than it is to memorize a lot of textbook implementations. Hence, I have designed this as a teaching...
  • №288
  • 2,38 МБ
  • добавлен
  • изменен
Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2009, -184 pp. A large class of problems in symbolic computation can be expressed as the task of computing some polynomials; and arithmetic circuits form the most standard model for studying the complexity of such computations. This algebraic model of computation attracted a large amount of...
  • №289
  • 1002,34 КБ
  • добавлен
  • изменен
Wiley, 2013. — 384 p. — ISBN: 1118343360, 9781118343364 The confluence of cloud computing, parallelism and advanced machine intelligence approaches has created a world in which the optimum knowledge system will usually be architected from the combination of two or more knowledge-generating systems. There is a need, then, to provide a reusable, broadly-applicable set of design...
  • №290
  • 6,75 МБ
  • добавлен
  • изменен
Издательство Birkhäuser, 1993, -158 pp. This monograph is a slightly revised version of my PhD thesis (86), completed in the Department of Computer Science at the University of Edinburgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers. The underlying theme of the monograph is the study of...
  • №291
  • 6,28 МБ
  • добавлен
  • изменен
2nd Edition. — Springer, 2008. — 746 p. — ISBN 1848000693. This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course...
  • №292
  • 5,20 МБ
  • добавлен
  • изменен
Springer International Publishing AG, 2017. — 456 p. — (Texts in Computer Science) — ISBN 3319554433. The Data Science Design Manual is a source of practical insights that highlights what really matters in analyzing data, and provides an intuitive understanding of how these core concepts can be used. The book does not emphasize any particular programming language or suite of...
  • №293
  • 20,38 МБ
  • добавлен
  • изменен
2nd edition. — Springer, 2012. — 730 p. — ISBN 978-1-84800-069-8. This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design...
  • №294
  • 5,51 МБ
  • добавлен
  • изменен
Springer, 2012. — 730 p. This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical...
  • №295
  • 6,21 МБ
  • добавлен
  • изменен
Techniques. Introduction to Algorithms. Data Structures and Sorting. Breaking Problems Down. Graph Algorithms. Combinatorial Search and Heuristic Methods. Intractable Problems and Approximations. How to Design Algorithms. Resources. A Catalog of Algorithmic Problems. Algorithmic Resources. Издательство: "Springer-Verlag", New York Год: 1997 Формат: HLP
  • №296
  • 1,10 МБ
  • дата добавления неизвестна
  • изменен
Packt Publishing, 2017. — 385 p. — ISBN 978-1787121041. Data types: foundational structures. Arrays: foundational collections. Lists: linear collections. Stacks: lifo collections. Queues: fifo collections. Dictionaries: keyed collections. Sets: no duplicates. Structs: complex types. Trees: non-linear structures. Heaps: ordered trees. Graphs: values with relationships. Sorting:...
  • №297
  • 157,20 КБ
  • добавлен
  • изменен
Packt Publishing, 2017. — 385 p. — ISBN-13 978-1787121041. If you want to learn different data structures and their real-world applications quickly through practical examples, then Everyday Data Structures is for you. This book can introduce you to new data structures and their potential applications through examples in languages common to mobile software development on the most...
  • №298
  • 2,04 МБ
  • добавлен
  • изменен
Packt Publishing, 2017. — 385 p. — ISBN-13 978-1787121041. If you want to learn different data structures and their real-world applications quickly through practical examples, then Everyday Data Structures is for you. This book can introduce you to new data structures and their potential applications through examples in languages common to mobile software development on the most...
  • №299
  • 1,02 МБ
  • добавлен
  • изменен
Packt Publishing, 2017. — 385 p. — ISBN-13 978-1787121041. If you want to learn different data structures and their real-world applications quickly through practical examples, then Everyday Data Structures is for you. This book can introduce you to new data structures and their potential applications through examples in languages common to mobile software development on the most...
  • №300
  • 1,09 МБ
  • добавлен
  • изменен
Oxford, Oxford University Press, 1993. - 184 p. This work is a sequel to the author's Gödel's Incompleteness Theorems, though it can be read independently by anyone familiar with Gödel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and...
  • №301
  • 7,23 МБ
  • добавлен
  • изменен
New York: Addison-Wesley, 1995. — 778 p. Using C, this book develops the concepts and theory of data structures and algorithm analysis step by step, proceeding from concrete examples to abstract principles. The material is unified by the use of recurring themes such as efficiency, recursion, representation and trade-offs. Important software engineering concepts are also covered,...
  • №302
  • 92,80 МБ
  • добавлен
  • изменен
Двумерные массивы используются для таких целей, как хранение изображений, задание графов и так далее. Но в большинстве языков программирования двумерный массив представляется в памяти как один большой одномерный массив размером КоличествоСтрок * КоличествоСтолбцов элементов, логически интерпретируемый как двумерный. Иногда появляется необходимость в создании динамического...
  • №303
  • 70,39 КБ
  • дата добавления неизвестна
  • изменен
Unpublished, 2012. — 157 p. This book was developed for the Certificate of Data Science program at Syracuse University's School of Information Studies.
  • №304
  • 18,46 МБ
  • добавлен
  • изменен
Mentor Graphics Corporation, 2007. 7 p. На англ. языке. Статья сотрудника фирмы Mentor Graphics об отслеживании требований к функциям и зависимостям в программных продуктах. Приведены графические схемы и диаграммы. Описанные приёмы проверены в течение нескольких лет.
  • №305
  • 445,77 КБ
  • добавлен
  • изменен
Pfeiffer, 2008. – 190 p. – ISBN: 0787987182, 9780787987183 Data Collection is the second of six books in the Measurement and Evaluation Series from Pfeiffer. The proven ROI Methodology—developed by the ROI Institute—provides a practical system for evaluation planning, data collection, data analysis, and reporting. All six books in the series offer the latest tools, most current...
  • №306
  • 2,24 МБ
  • добавлен
  • изменен
John Wiley, 2013. — 759 p. Algorithms are the recipes that make efficient programming possible. They explain how to sort records, search for items, calculate numeric values such as prime factors, find the shortest path between two points in a street network, and determine the maximum flow of information possible through a communications network. The difference between using a good...
  • №307
  • 5,11 МБ
  • добавлен
  • изменен
Dey Street Books, 2017. — 352 p. The book offers fascinating, surprising, and sometimes laugh-out-loud insights into everything from economics to ethics to sports to race to sex, gender and more, all drawn from the world of big data. What percentage of white voters didn’t vote for Barack Obama because he’s black? Does where you go to school effect how successful you are in life?...
  • №308
  • 2,65 МБ
  • добавлен
  • изменен
Birkhauser, 2001. — 599 p. — ISBN: 0817642536, 9780817642532 Data structures and algorithms are presented at the college level in a highly accessible format that presents material with one-page displays in a way that will appeal to both teachers and students. The thirteen chapters cover: Models of Computation, Lists, Induction and Recursion, Trees, Algorithm Design, Hashing,...
  • №309
  • 13,79 МБ
  • добавлен
  • изменен
Springer, 2018. — 376 p. This accessible and engaging textbook/guide provides a concise introduction to data structures and associated algorithms. Emphasis is placed on the fundamentals of data structures, enabling the reader to quickly learn the key concepts, and providing a strong foundation for later studies of more complex topics. The coverage includes discussions on stacks,...
  • №310
  • 2,82 МБ
  • добавлен
  • изменен
Springer, 2018. — 376 p. This accessible and engaging textbook/guide provides a concise introduction to data structures and associated algorithms. Emphasis is placed on the fundamentals of data structures, enabling the reader to quickly learn the key concepts, and providing a strong foundation for later studies of more complex topics. The coverage includes discussions on stacks,...
  • №311
  • 11,36 МБ
  • добавлен
  • изменен
Mark Boulton Design Ltd, 2010. – 225 p. – ISBN: 0956174086, 9780956174086 In recent years, the terms Visualization, Infographic and others have been bantered around with almost no regard to their use or meaning. There is a new vernacular emerging in the realms of data representations, but that doesn’t mean we can ignore the much simpler origins and best practices of charts and...
  • №312
  • 4,67 МБ
  • добавлен
  • изменен
Society for Industrial and Applied Mathematics, 1983, -131 pp. In the last fifteen years there has been an explosive growth in the field of combinatorial algorithms. Although much of the recent work is theoretical in nature, many newly discovered algorithms are quite practical. These algorithms depend not only on new results in combinatorics and especially in graph theory, but...
  • №313
  • 1,23 МБ
  • добавлен
  • изменен
2nd ed. — New Delhi: Oxford University Press, 2014. — 557 p. This second edition of Data Structures Using C has been developed to provide a comprehensive and consistent coverage of both the abstract concepts of data structures as well as the implementation of these concepts using C language. It begins with a thorough overview of the concepts of C programming followed by...
  • №314
  • 17,91 МБ
  • добавлен
  • изменен
Springer, 2019. — 175 р. This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in...
  • №315
  • 3,33 МБ
  • добавлен
  • изменен
Springer, 2019. — 175 р. This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in...
  • №316
  • 9,15 МБ
  • добавлен
  • изменен
Apress, 2017. — 285 p. — ISBN: 978-1-4842-2336-9 Learn to use Apache Pig to develop lightweight big data applications easily and quickly. This book shows you many optimization techniques and covers every context where Pig is used in big data analytics. Beginning Apache Pig shows you how Pig is easy to learn and requires relatively little time to develop big data applications. The...
  • №317
  • 4,59 МБ
  • добавлен
  • изменен
Atlantis Press, 2013. — 131 p. — ISBN: 9462390320 Data compression is mandatory to manage massive datasets, indexing is fundamental to query them. However, their goals appear as counterposed: the former aims at minimizing data redundancies, whereas the latter augments the dataset with auxiliary information to speed up the query resolution. In this monograph we introduce...
  • №318
  • 1,66 МБ
  • добавлен
  • изменен
Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2009, -74 pp. In this monograph we discuss selected topics on small-depth computation, presenting a few unpublished proofs along the way. The four sections contain: A unified treatment of the challenge of exhibiting explicit functions that have small correlation with low-degree polynomials...
  • №319
  • 505,13 КБ
  • добавлен
  • изменен
Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2008, -171 pp. Data sets in large applications are often too massive to fit completely inside the computer’s internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In...
  • №320
  • 907,92 КБ
  • добавлен
  • изменен
Издательство Springer, 2012, -270 pp. The subject of this book is the analysis and design of digital devices that implement computer arithmetic. The book's presentation of high-level detail, descriptions, formalisms and design principles means that it can support many research activities in this field, with an emphasis on bridging the gap between algorithm optimization and...
  • №321
  • 2,40 МБ
  • добавлен
  • изменен
Издательство Springer, 2012, -270 pp. The subject of this book is the analysis and design of digital devices that implement computer arithmetic. The book's presentation of high-level detail, descriptions, formalisms and design principles means that it can support many research activities in this field, with an emphasis on bridging the gap between algorithm optimization and...
  • №322
  • 7,85 МБ
  • добавлен
  • изменен
Technics Publications, 2017. — 228 p. — ISBN 10 1634622561, 13 978-1634622561, ASIN B074R7HL2W. From the author of the bestsellers, Data Scientist and Julia for Data Science, this book covers four foundational areas of data science. The first area is the data science pipeline including methodologies and the data scientist's toolbox. The second are essential practices needed in...
  • №323
  • 763,26 КБ
  • добавлен
  • изменен
Technics Publications, 2017. — 62 p. — ISBN 10 1634622561, 13 978-1634622561, ASIN B074R7HL2W. From the author of the bestsellers, Data Scientist and Julia for Data Science, this book covers four foundational areas of data science. The first area is the data science pipeline including methodologies and the data scientist's toolbox. The second are essential practices needed in...
  • №324
  • 1,43 МБ
  • добавлен
  • изменен
Technics Publications, 2017. — 140 p. — ISBN 10 1634622561, 13 978-1634622561, ASIN B074R7HL2W. From the author of the bestsellers, Data Scientist and Julia for Data Science, this book covers four foundational areas of data science. The first area is the data science pipeline including methodologies and the data scientist's toolbox. The second are essential practices needed in...
  • №325
  • 683,66 КБ
  • добавлен
  • изменен
Technics Publications, 2017. — 141 p. — ISBN 10 1634622561, 13 978-1634622561, ASIN B074R7HL2W. From the author of the bestsellers, Data Scientist and Julia for Data Science, this book covers four foundational areas of data science. The first area is the data science pipeline including methodologies and the data scientist's toolbox. The second are essential practices needed in...
  • №326
  • 1007,18 КБ
  • добавлен
  • изменен
N.-Y.: Kluwer, 2002. — 164 p. Data Quality provides an exposé of research and practice in the data quality field for technically oriented readers. It is based on the research conducted at the MIT Total Data Quality Management (TDQM) program and work from other leading research institutions.
  • №327
  • 1,09 МБ
  • добавлен
  • изменен
Addison-Wesley, 2012 — 512 p. In Hacker’s Delight, Second Edition, Hank Warren once again compiles an irresistible collection of programming hacks: timesaving techniques, algorithms, and tricks that help programmers build more elegant and efficient software, while also gaining deeper insights into their craft. Warren’s hacks are eminently practical, but they’re also...
  • №328
  • 44,71 МБ
  • добавлен
  • изменен
Second Edition. — Pearson Education, 2013. — 470 p. — ISBN 0-321-84268-5. In Hacker’s Delight, Second Edition, Hank Warren once again compiles an irresistible collection of programming hacks: timesaving techniques, algorithms, and tricks that help programmers build more elegant and efficient software, while also gaining deeper insights into their craft. Warren’s hacks are...
  • №329
  • 12,22 МБ
  • добавлен
  • изменен
Издательство Morgan Kaufman, 1999, -252 pp. Символы "fi" отображаются как ^ The science of compressing data is the art of creating shorthand representations for the data—that is, automatically finding abbreviations; i.e. yadda yadda yadda, etc. All of the algorithms can be described with a simple phrase: Look for repetition, and replace the repetition with a shorter...
  • №330
  • 3,28 МБ
  • добавлен
  • изменен
Издательство Springer, 2013, -53 pp. Once upon a time, the most difficult aspect of signal processing was acquiring enough data. Nowadays, one can sample at very high rates and collect huge data sets, but processing the data in a timely manner, without exceeding available memory, is challenging, despite continuing advances in computer technology. Meeting this challenge requires...
  • №331
  • 277,66 КБ
  • добавлен
  • изменен
Pearson Education, Inc., 2013. — 656 p. — ISBN: 013284737X. На англ. языке. Data Structures and Algorithm Analysis in C++ is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills...
  • №332
  • 4,21 МБ
  • добавлен
  • изменен
Pragmatic Bookshelf, 2017. — 220 p. Algorithms and data structures are much more than abstract concepts. Mastering them enables you to write code that runs faster and more efficiently, which is particularly important for today’s web and mobile apps. This book takes a practical approach to data structures and algorithms, with techniques and real-world scenarios that you can use in...
  • №333
  • 3,06 МБ
  • добавлен
  • изменен
Pragmatic Bookshelf, 2017. — 220 p. Algorithms and data structures are much more than abstract concepts. Mastering them enables you to write code that runs faster and more efficiently, which is particularly important for today’s web and mobile apps. This book takes a practical approach to data structures and algorithms, with techniques and real-world scenarios that you can use in...
  • №334
  • 3,26 МБ
  • добавлен
  • изменен
Basel, Switzerland: MDPI, 2018. — 210 p. — ISBN 978-3-03897-119-1. This edited book presents new results in the area of algorithm development for different types of scheduling problems. In eleven chapters, algorithms for single machine problems, flow-shop and job-shop scheduling problems (including their hybrid (flexible) variants), the resource-constrained project scheduling...
  • №335
  • 3,82 МБ
  • добавлен
  • изменен
Prentice Hall, 1978. — 200 p. — ISBN 978-0-13-291807-7. A collection of problems for "learning by doing," similar to real-life programming work. What’s It All About, Alfie? The Game of LIFE Why Is the Ocean Blue, Daddy? Printer’s Devil Winning Is the Only Thing Strike It Rich Kriss-Kross Theseus Know Thyself Yielding Up Its Gold Ye Soule of Witte A Sense of...
  • №336
  • 2,05 МБ
  • добавлен
  • изменен
Atlantis Press, 2016. — 240 p. — ISBN 978-94-6239-182-6. This book demonstrates the inevitability of a continuously growing role of data in our society and it stresses that this role does not need to be threatening: to the contrary, collection and analysis of data can help us prevent traffic jams, suppress epidemics, or produce tailor made medicine. The authors sketch the...
  • №337
  • 2,58 МБ
  • добавлен
  • изменен
Packt Publishing, 2017. — 385 p. — ISBN-13 978-1787121041. True PDF If you want to learn different data structures and their real-world applications quickly through practical examples, then Everyday Data Structures is for you. This book can introduce you to new data structures and their potential applications through examples in languages common to mobile software development on...
  • №338
  • 2,15 МБ
  • добавлен
  • изменен
Kluwer, 1991. — 403 p. The class of Markov data compression algorithms provides the best known compression for ordinary symbol data. Of these, the PPM (Prediction by Partial Matching) algorithm by Cleary and Witten (1984) is the most successful. This thesis reviews the class of Markov algorithms and introduces algorithms similar to PPM which are used as a vehicle for examining...
  • №339
  • 6,93 МБ
  • добавлен
  • изменен
Cambridge University Press, 2011. – 516 p. – ISBN: 0521195276, 9780521195270 Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP,...
  • №340
  • 2,76 МБ
  • добавлен
  • изменен
CRC Press, 2016. — 512 р. — ISBN 978-1482215397. Combining knowledge with strategies, Data Structure Practice for Collegiate Programming Contests and Education presents the first comprehensive book on data structure in programming contests. This book is designed for training collegiate programming contest teams in the nuances of data structure and for helping college students...
  • №341
  • 12,20 МБ
  • добавлен
  • изменен
CreateSpace Independent Publishing Platform, 2014. — 150 p. — ISBN: 1500173452, 9781500173456 An algorithm is a solution to a class of problems generally contained in programming unit called a module and accessed by one or more objected oriented programs. A class on algorithms is a class on problem solving with the expectation of marketable results. This requires a textbook...
  • №342
  • 3,32 МБ
  • добавлен
  • изменен
Издательство Springer, 2002, -159 pp. Many new applications, such as multimedia databases, employ the so-called feature transformation which transforms important features or properties of data objects into high-dimensional points. Searching for ‘similar’ objects based on these features is thus a search of points in this feature space. Another high-dimensional database example...
  • №343
  • 1,03 МБ
  • добавлен
  • изменен
New York: Springer, 2015. — 418 p. This Festschrift volume is published in honor of Professor Paul G. Spirakis on the occasion of his 60th birthday. It celebrates his significant contributions to computer science as an eminent, talented, and influential researcher and most visionary thought leader, with a great talent in inspiring and guiding young researchers. The book is a...
  • №344
  • 9,83 МБ
  • добавлен
  • изменен
Издательство InTech, 2010, -224 pp. Fault diagnosis technology is a synthetic technology, which relates to several subjects, such as modern control theory, reliability theory, mathematical statistics, fussy set theory, information handling, pattern recognition and artificial intelligence. The United States is the first study to carry out fault diagnosis countries. Since 1961,...
  • №345
  • 16,08 МБ
  • добавлен
  • изменен
Справочное пособие. — М.: Советское радио, 1975. — 176 с. с ил. — (Библиотека технической кибернетики) В книге приводятся описания алгоритмов по самому широкому кругу вопросов прикладной математики и программирования на алгоритмическом языке АЛГОЛ-60, публиковавшихся ранее в журнале «Communications of the ACM» (США) под номерами 1-50, переведенных на русский язык,...
  • №346
  • 2,82 МБ
  • добавлен
  • изменен
Справочное пособие. — М.: Советское радио, 1967. — (Библиотека технической кибернетики) В книге приводятся описания алгоритмов по самому широкому КРУГУ вопросов прикладной математики и программирования на алгоритмическом языке АЛГОЛ-60, публиковавшихся ранее в журнале «Communications of the ACM» (США) под номерами 1—50, переведенных на русский язык, исправленных, улучшенных и...
  • №347
  • 1,95 МБ
  • дата добавления неизвестна
  • изменен
В книге приводятся описания алгоритмов по широкому кругу вопросов прикладной математики и программирования на алгоритмическом языке АЛГОЛ-60, публиковавшихся первоначально в журнале «Communications of the ACM» (США) под номерами 51—100, переведенных на русский язык, исправленных, улучшенных и отлаженных на ЭВМ авторами данного выпуска. Каждый алгоритм снабжен подтверждениями и...
  • №348
  • 1,56 МБ
  • дата добавления неизвестна
  • изменен
В книге приводятся описания алгоритмов по широкому кругу вопросов прикладной математики и программирования «на языке АЛГОЛ-60, публиковавшихся первоначально в журнале «Communications of the ACM» (США) под номерами 101—150, переведенных на русский язык, исправленных, улучшенных я отлаженных на ЭВМ авторами данного выпуска. Каждый алгоритм снабжен подтверждениями и свидетельствами,...
  • №349
  • 1,44 МБ
  • дата добавления неизвестна
  • изменен
Приведены переводы на русский язык алгоритмов на языке-АЛГОЛ-60 по вопросам прикладной математики и программирования, публиковавшихся в журнале «САСМ» (США) под номерами 151—200,, исправленных, улучшенных и отлаженных на ЭВМ, а также снабженных подтверждениями и свидетельствами. Как приложения приводятся описание нерекурсивной программы решения шахматных многоходовок, а также...
  • №350
  • 2,86 МБ
  • дата добавления неизвестна
  • изменен
Определение Двоичного Дерева Поиска (Binary Search Tree, BST). Свойство упорядоченности двоичного дерева поиска. Способы обхода ДДП. Поиск вершины в ДДП. Поиск вершины с минимальным и максимальным значением ключа. Нахождение следующей и предыдущей вершины в ДДП. Добавление вершины. Удаление вершины. NIL, NULL и маленькие хитрости. Основная проблема использования ДДП....
  • №351
  • 175,90 КБ
  • дата добавления неизвестна
  • изменен
Интро. Использование BSP деревьев. Создание BSP деревьев. BSP деревья и другие алгоритмы рисования. Эта статья объясняет как BSP деревья (binary space partition, двоичное деление пространства) могут быть использованы частью алгоритмов прорисовки для удаления односторонних поверхностей, частичной z-сортировки, удаления невидимых частей.
  • №352
  • 32,14 КБ
  • дата добавления неизвестна
  • изменен
Описаны алгоритмы сжатия данных Running, LZW, алгоритм Хаффмана
  • №353
  • 9,28 КБ
  • дата добавления неизвестна
  • изменен
IBM Global Business Services, 2014. — 28 с. Как российские организации смогут догнать лидеров гонки за бизнесом, основанном на данных. Практика IBM Strategy & Analytics объединяет опыт управленческого консультирования с аналитической наукой, создавая возможности успеха организаций лидеров. IBM помогает клиентам полностью осознать потенциал Больших данных и аналитики, предоставляя...
  • №354
  • 1,16 МБ
  • добавлен
  • изменен
Ульяновск: УлГТУ, 2011. – 227 с. Содержание учебного пособия включает информацию по составлению алгоритмов и практическому программированию на языке Turbo Pascal при решении сложных задач, которая может быть использована для подготовки к выполнению контрольных, лабораторных и практических заданий по курсам «Программные и аппаратные средства информатики», «Информационные...
  • №355
  • 887,79 КБ
  • добавлен
  • изменен
М.: Вильямс, 2000. — 384 с. — ISBN 5-8459-0122-7. В этой книге подробно рассмотрены структуры данных и алгоритмы, которые являются фундаментом современной методологии разработки программ. Показаны разнообразные реализации абстрактных типов данных, начиная от стандартных списков, стеков, очередей и заканчивая множествами и отображениями, которые используются для неформального...
  • №356
  • 15,28 МБ
  • добавлен
  • изменен
Перевод с английского : Учебное пособие — М.: Вильямс, 2000. — 384 с. — ISBN 5-8459-0122-7; ISBN 0-201-00023-7. В этой книге подробно рассмотрены структуры данных и алгоритмы, которые являются фундаментом современной методологии разработки программ. Показаны разнообразные реализации абстрактных типов данных, начиная от стандартных списков, стеков, очередей и заканчивая множествами...
  • №357
  • 4,04 МБ
  • дата добавления неизвестна
  • изменен
Пер. с англ. : Уч. пос. - М. : Издательский дом "Вильямс", 2000. - 384 с. : ил. - Парал. тит. англ. В этой книге подробно рассмотрены структуры данных и алгоритмы, которые являются фундаментом современной методологии разработки программ. Показаны разнообразные реализации абстрактных типов данных, начиная от стандартных списков, стеков, очередей и заканчивая множествами и...
  • №358
  • 26,20 МБ
  • дата добавления неизвестна
  • изменен
Пер. с англ. : Уч. пос. - М. : Издательский дом "Вильямс", 2000. - 384 с. : ил. - Парал. тит. англ. В этой книге подробно рассмотрены структуры данных и алгоритмы, которые являются фундаментом современной методологии разработки программ. Показаны разнообразные реализации абстрактных типов данных, начиная от стандартных списков, стеков, очередей и заканчивая множествами и...
  • №359
  • 13,92 МБ
  • добавлен
  • изменен
Учеб. пособие / Р.В. Батищев .— Липецк : ЛГТУ, 2014 - 89 с. В учебном пособии рассматриваются вопросы внутримашинного представления данных и структур разных типов, алгоритмы внутренней и внешней сортировки, организации и обработки динамических структур данных. Пособие содержит теоретический материал с иллюстрациями алгоритмов и примерами программ на языке программирования...
  • №360
  • 1,10 МБ
  • добавлен
  • изменен
М.: Радио и связь, 1990. — 224 с. — ISBN 5-256-00704-1. Наряду с конкретными примерами даны общие рекомендации по составлению оптимальных алгоритмов и программ. Рассмотрение построено по следующему принципу; постановка задачи, пример традиционного решения и объяснение его недостатков, углубленный анализ задачи н найденное в результате этого лучшее решение, изложение ряда принципов...
  • №361
  • 13,26 МБ
  • добавлен
  • изменен
2-е издание. — СПб.: Питер, 2002. — 272 с: ил. ISBN 5-318-00715-5 Эта книга написана для программистов. Хороший программист должен знать все, что написано до него, только тогда он будет писать хорошие программы, главы этой книги посвящены наиболее привлекательному аспекту профессии программиста: жемчужинам программирования, рождающимся за пределами работы, в области фантазии и...
  • №362
  • 2,95 МБ
  • добавлен
  • изменен
Пер. с английского М. Г. Логунова. Под редакцией И. Г. Шестакова. — М.: Радио и связь, 1990. — 224 с.: ил. — ISBN 5-256-00704-1. В книге на различных примерах из практики программирования показано, как хорошее понимание особенностей поставленной задачи позволяет найти оптимальное по быстродействию, объему используемой памяти и легкости модифицирования решение. Наряду с конкретными...
  • №363
  • 1,51 МБ
  • дата добавления неизвестна
  • изменен
Пер. с англ. — М.: Радио и связь, 1990. — 224 с.: ил. — ISBN 5-256-00704-1. В книге американского автора на различных примерах из практики программирования показано, как хорошее понимание особенностей поставленной задачи позволяет найти оптимальное по быстродействию, объему требуемой памяти, легкости модификации решения. Наряду с конкретными примерами даны общие рекомендации по...
  • №364
  • 2,99 МБ
  • добавлен
  • изменен
Дискретные структуры в математике. Теория множеств. Функции и отношения. Теория графов. Строки. Практические приложения структур. Деревья. Пути и циклы в орографах. Орографы программ. Другие приложения теории графов. Машинное представление структур. Массивы. Стэковая память, списки и списковые структуры. Организация массивов. Языки программирования для информационных...