Data Structures: For Anna University CSE | IT Courses, J. John Manoj Kumar, P. Sudarshan
Автор: Daniel J. Velleman Название: How to Prove It : A Structured Approach ISBN: 1108439535 ISBN-13(EAN): 9781108439534 Издательство: Cambridge Academ Рейтинг: Цена: 5861.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proofs play a central role in advanced mathematics and theoretical computer science, and this bestselling text`s third edition will help students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs, with a new chapter on number theory and over 150 new exercises.
Автор: Barab?si Название: Network Science ISBN: 1107076269 ISBN-13(EAN): 9781107076266 Издательство: Cambridge Academ Рейтинг: Цена: 7762.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Okasaki Название: Purely Functional Data Structures ISBN: 0521631246 ISBN-13(EAN): 9780521631242 Издательство: Cambridge Academ Рейтинг: Цена: 12355.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Most books on data structures assume an imperative language. However, their data structures do not translate well to functional languages. This book describes data structures and data structure design techniques from the point of view of functional languages. It is a reference for functional programmers and a text for self-study.
Автор: Bal?zs B?nhelyi; Tibor Csendes; Bal?zs L?vai; L?sz Название: The GLOBAL Optimization Algorithm ISBN: 3030023745 ISBN-13(EAN): 9783030023744 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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 practitioners in optimization, operations research, and mathematics to compose their own scripts with ease. A GLOBAL manual is presented in the appendix to assist new users with modules and test functions. GLOBAL is a successful stochastic multistart global optimization algorithm that has passed several computational tests, and is efficient and reliable for small to medium dimensional global optimization problems. The algorithm uses clustering to ensure efficiency and is modular in regard to the two local search methods it starts with, but it can also easily apply other local techniques. The strength of this algorithm lies in its reliability and adaptive algorithm parameters. The GLOBAL algorithm is free to download also in the earlier Fortran, C, and MATLAB implementations.
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.
Описание: 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.
Автор: P?ter G?bor Szab?; Mihaly Csaba Mark?t; Tibor Csen Название: New Approaches to Circle Packing in a Square ISBN: 0387456732 ISBN-13(EAN): 9780387456737 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Summarizes results achieved in solving the circle packing problem. This work provides the reader with a comprehensive view of theoretical and computational achievements. It also includes a CD that provides the various open source programming codes used, enabling the reader to improve on them and solve the problem instances that remain challenging.
Описание: 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.
Автор: von zur Gathen Название: Modern Computer Algebra ISBN: 1107039037 ISBN-13(EAN): 9781107039032 Издательство: Cambridge Academ Рейтинг: Цена: 17582.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Designed to accompany one- or two-semester courses for advanced undergraduate or graduate students, this textbook is widely regarded as the `bible of computer algebra`. Its comprehensiveness and reliability also makes it an essential reference for professionals. This updated edition includes an overview of recent improvements in areas like primality testing.
Описание: 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.
Описание: Integer linear programming is a versatile modeling and optimization technique with potential to transform biological computation. This hands-on text, designed for students, researchers, and professionals in both biology and computational fields, demonstrates applications in genomics, RNA and protein folding, DNA sequencing, phylogenetics, and more.
Описание: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
