Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7 707 857-29-98
  +7(7172) 65-23-70
  10:00-18:00 пн-пт
  shop@logobook.kz
   
    Поиск книг                        
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Бестселлеры | |
 

Algorithms in Action, Victor Adamchik


Варианты приобретения
Цена: 71150.00T
Кол-во:
 о цене
Наличие: Отсутствует. 
Возможна поставка под заказ. Дата поступления на склад уточняется после оформления заказа


Добавить в корзину
в Мои желания

Автор: Victor Adamchik
Название:  Algorithms in Action
ISBN: 9781516535064
Издательство: Mare Nostrum (Eurospan)
Классификация:



ISBN-10: 1516535065
Обложка/Формат: Paperback
Страницы: 190
Вес: 0.39 кг.
Дата издания: 30.01.2020
Серия: Computing & IT
Язык: English
Размер: 254 x 203 x 10
Читательская аудитория: Professional and scholarly
Ключевые слова: Algorithms & data structures,Computer science,Software Engineering,Systems analysis & design
Рейтинг:
Поставляется из: Англии
Описание: Algorithms in Action effectively introduces students to a variety of techniques for designing algorithms with a focus on developing intuitive understanding. Readers learn how to successfully construct foundational algorithms, preparing them for more advanced courses in the discipline, as well as professional application.

Over the course of nine chapters, students learn fundamental concepts critical to the development of algorithms, paired with detailed visual representations that walk readers step-by-step through algorithm execution. The text begins with a review of runtime complexity, lower bound for sorting, and trees and graphs, then moves into more complex topical areas, including amortized analysis, heaps, dynamic programming, network flow, linear programming, and NP-completeness. The book includes over 160 figures, as well as review questions and exercises at the end of each chapter, to encourage learning, retention, practice, and application.

Developed to provide students with an approachable and effective introduction to algorithm design, Algorithms in Action is an ideal resource for advanced undergraduate or master-level courses in computer science or related technical disciplines. Foundational knowledge of discrete mathematics, data structures, and calculus is recommended as a prerequisite.


Network Science

Автор: Barab?si
Название: Network Science
ISBN: 1107076269 ISBN-13(EAN): 9781107076266
Издательство: Cambridge Academ
Рейтинг:
Цена: 51750.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Illustrated throughout in full colour, this pioneering textbook, spanning a wide range of disciplines from physics to the social sciences, is the only book needed for an introduction to network science. In modular format, with clear delineation between undergraduate and graduate material, its unique design is supported by extensive online resources.

Algorithms Illuminated, Part 1: The Basics

Автор: Roughgarden Tim
Название: Algorithms Illuminated, Part 1: The Basics
ISBN: 0999282905 ISBN-13(EAN): 9780999282908
Издательство: Неизвестно
Цена: 18380.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Provides a conceptual approach that will encourage students learning algebra to employ a variety of thinking processes and strategies and, most importantly, will enable them to truly understand the concepts that underlie the problems they are solving. The book includes tasks focusing on algebraic expressions, equations, and functions, followed by tasks that integrate several mathematical concepts.

Handbook of Approximation Algorithms and Metaheuristics

Название: Handbook of Approximation Algorithms and Metaheuristics
ISBN: 1498770150 ISBN-13(EAN): 9781498770156
Издательство: Taylor&Francis
Рейтинг:
Цена: 433840.00 T
Наличие на складе: Нет в наличии.
Описание: This handbook reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics.

Formation methods, models, and hardware implementation of pseudorandom number generators :

Автор: Bilan, Stepan,
Название: Formation methods, models, and hardware implementation of pseudorandom number generators :
ISBN: 1522527737 ISBN-13(EAN): 9781522527732
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 189030.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Modern computing systems preserve all information in intricate binary codes. The evolution of systems and technologies that aid in this preservation process must be continually assessed to ensure that they are keeping up with the demands of society. Formation Methods, Models, and Hardware Implementation of Pseudorandom Number Generators: Emerging Research and Opportunities is a crucial scholarly resource that examines the current methodologies used in number generator construction, and how they pertain to the overall advancement of contemporary computer systems. Featuring coverage on relevant topics such as cellular automata theory, inhomogeneous cells, and sequence generators, this publication is ideal for software engineers, computer programmers, academicians, students, and researchers that are interested in staying abreast of innovative trends within the computer engineering field.

Algorithms illuminated (part 2)

Автор: Roughgarden, Tim
Название: Algorithms illuminated (part 2)
ISBN: 0999282921 ISBN-13(EAN): 9780999282922
Издательство: Неизвестно
Рейтинг:
Цена: 18380.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 2 covers graph search and applications, shortest paths, and the usage and implementation of several data structures (heaps, search trees, hash tables, and bloom filters).


Algorithms and Applications for Academic Search, Recommendation and Quantitative Association Rule Mining

Автор: Emmanouil Amolochitis
Название: Algorithms and Applications for Academic Search, Recommendation and Quantitative Association Rule Mining
ISBN: 8793609647 ISBN-13(EAN): 9788793609648
Издательство: Taylor&Francis
Рейтинг:
Цена: 78590.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Algorithms and Applications for Academic Search, Recommendation and Quantitative Association Rule Mining presents novel algorithms for academic search, recommendation and association rule mining that have been developed and optimized for different commercial as well as academic purpose systems. Along with the design and implementation of algorithms, a major part of the work presented in the book involves the development of new systems both for commercial as well as for academic use. In the first part of the book the author introduces a novel hierarchical heuristic scheme for re-ranking academic publications retrieved from standard digital libraries. The scheme is based on the hierarchical combination of a custom implementation of the term frequency heuristic, a time-depreciated citation score and a graph-theoretic computed score that relates the paper’s index terms with each other. In order to evaluate the performance of the introduced algorithms, a meta-search engine has been designed and developed that submits user queries to standard digital repositories of academic publications and re-ranks the top-n results using the introduced hierarchical heuristic scheme. In the second part of the book the design of novel recommendation algorithms with application in different types of e-commerce systems are described. The newly introduced algorithms are a part of a developed Movie Recommendation system, the first such system to be commercially deployed in Greece by a major Triple Play services provider. The initial version of the system uses a novel hybrid recommender (user, item and content based) and provides daily recommendations to all active subscribers of the provider (currently more than 30,000). The recommenders that we are presenting are hybrid by nature, using an ensemble configuration of different content, user as well as item-based recommenders in order to provide more accurate recommendation results.The final part of the book presents the design of a quantitative association rule mining algorithm. Quantitative association rules refer to a special type of association rules of the form that antecedent implies consequent consisting of a set of numerical or quantitative attributes. The introduced mining algorithm processes a specific number of user histories in order to generate a set of association rules with a minimally required support and confidence value. The generated rules show strong relationships that exist between the consequent and the antecedent of each rule, representing different items that have been consumed at specific price levels. This research book will be of appeal to researchers, graduate students, professionals, engineers and computer programmers.

Sequential and Parallel Algorithms and Data Structures

Название: Sequential and Parallel Algorithms and Data Structures
ISBN: 3030252086 ISBN-13(EAN): 9783030252083
Издательство: Springer
Рейтинг:
Цена: 41920.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This undergraduate textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems.

Recent advances on memetic algorithms and its applications in image processing

Автор: D Jude Hemanth
Название: Recent advances on memetic algorithms and its applications in image processing
ISBN: 9811513619 ISBN-13(EAN): 9789811513619
Издательство: Springer
Рейтинг:
Цена: 139750.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book includes original research findings in the field of memetic algorithms for image processing applications.

Computational Intelligence for Machine Learning and Healthcare Informatics

Автор: Rajshree Srivastava, Pradeep Kumar Mallick, Siddha
Название: Computational Intelligence for Machine Learning and Healthcare Informatics
ISBN: 3110647826 ISBN-13(EAN): 9783110647822
Издательство: Walter de Gruyter
Цена: 136310.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: THE SERIES: INTELLIGENT BIOMEDICAL DATA ANALYSIS
By focusing on the methods and tools for intelligent data analysis, this series aims to narrow the increasing gap between data gathering and data comprehension. Emphasis is also given to the problems resulting from automated data collection in modern hospitals, such as analysis of computer-based patient records, data warehousing tools, intelligent alarming, effective and efficient monitoring. In medicine, overcoming this gap is crucial since medical decision making needs to be supported by arguments based on existing medical knowledge as well as information, regularities and trends extracted from big data sets.

Collaborative Recommendations: Algorithms, Practical Challenges and Applications

Автор: Berkovsky Shlomo, Cantador Ivan, Tikk Domonkos
Название: Collaborative Recommendations: Algorithms, Practical Challenges and Applications
ISBN: 9813275340 ISBN-13(EAN): 9789813275348
Издательство: World Scientific Publishing
Рейтинг:
Цена: 258720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Recommender systems are very popular nowadays, as both an academic research field and services provided by numerous companies for e-commerce, multimedia and Web content. Collaborative-based methods have been the focus of recommender systems research for more than two decades.

The unique feature of the compendium is the technical details of collaborative recommenders. The book chapters include algorithm implementations, elaborate on practical issues faced when deploying these algorithms in large-scale systems, describe various optimizations and decisions made, and list parameters of the algorithms.

This must-have title is a useful reference materials for researchers, IT professionals and those keen to incorporate recommendation technologies into their systems and services.


Algorithms for Data Science

Автор: Steele
Название: Algorithms for Data Science
ISBN: 3319457950 ISBN-13(EAN): 9783319457956
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

This textbook on practical data analytics unites fundamental principles, algorithms, and data. Algorithms are the keystone of data analytics and the focal point of this textbook. Clear and intuitive explanations of the mathematical and statistical foundations make the algorithms transparent. But practical data analytics requires more than just the foundations. Problems and data are enormously variable and only the most elementary of algorithms can be used without modification. Programming fluency and experience with real and challenging data is indispensable and so the reader is immersed in Python and R and real data analysis. By the end of the book, the reader will have gained the ability to adapt algorithms to new problems and carry out innovative analyses.
This book has three parts:
(a) Data Reduction: Begins with the concepts of data reduction, data maps, and information extraction. The second chapter introduces associative statistics, the mathematical foundation of scalable algorithms and distributed computing. Practical aspects of distributed computing is the subject of the Hadoop and MapReduce chapter.
(b) Extracting Information from Data: Linear regression and data visualization are the principal topics of Part II. The authors dedicate a chapter to the critical domain of Healthcare Analytics for an extended example of practical data analytics. The algorithms and analytics will be of much interest to practitioners interested in utilizing the large and unwieldly data sets of the Centers for Disease Control and Prevention's Behavioral Risk Factor Surveillance System.
(c) Predictive Analytics Two foundational and widely used algorithms, k-nearest neighbors and naive Bayes, are developed in detail. A chapter is dedicated to forecasting. The last chapter focuses on streaming data and uses publicly accessible data streams originating from the Twitter API and the NASDAQ stock market in the tutorials.This book is intended for a one- or two-semester course in data analytics for upper-division undergraduate and graduate students in mathematics, statistics, and computer science. The prerequisites are kept low, and students with one or two courses in probability or statistics, an exposure to vectors and matrices, and a programming course will have no difficulty. The core material of every chapter is accessible to all with these prerequisites. The chapters often expand at the close with innovations of interest to practitioners of data science. Each chapter includes exercises of varying levels of difficulty. The text is eminently suitable for self-study and an exceptional resource for practitioners.

Geometry and Complexity Theory

Автор: Landsberg JM
Название: Geometry and Complexity Theory
ISBN: 1107199239 ISBN-13(EAN): 9781107199231
Издательство: Cambridge Academ
Рейтинг:
Цена: 64410.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A comprehensive introduction to algebraic geometry and representation theory written by a leading expert in the field. For graduate students and researchers in computer science and mathematics, the book demonstrates state-of-the-art techniques to solve real world problems, focusing on P vs NP and the complexity of matrix multiplication.


Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2)
ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
Kaspi QR
   В Контакте     В Контакте Мед  Мобильная версия