Search results for "data structures and algorithms in java"
Items we need to order for you
Average Case Analysis of Algorithms on Sequences
A timely book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications, most notably in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms, combining both analytical and probabilistic tools in a single volume. * Tools are illustrated through problems on words with applications to molecular biology, data compression, security, and pattern matching. * Includes chapters on algorithms and data structures on words, probabilistic and analytical models, inclusion-exclusion principles, first and second moment methods, subadditive ergodic theorem and large deviations, elements of information theory, generating functions, complex asymptotic methods, Mellin transform and its applications, and analytic poissonization and depoissonization. * Written by an established researcher with a strong international reputation in the field.
R 7,716.00
Algorithms in Bioinformatics
This book constitutes the refereed proceedings of the 14th International Workshop on Algorithms in Bioinformatics, WABI 2014, held in Wroclaw, Poland, in September 2014. WABI 2014 was one of seven conferences that were organized as part of ALGO 2014. WABI is an annual conference series on all aspects of algorithms and data structure in molecular biology, genomics and phylogeny data analysis. The 26 full papers presented together with a short abstract were carefully reviewed and selected from 61 submissions. The selected papers cover a wide range of topics from sequence and genome analysis through phylogeny reconstruction and networks to mass spectrometry data analysis.
R 2,187.26
Top Ten Algorithms in Data Mining
Identifying some of the most influential algorithms that are widely used in the data mining community, The Top Ten Algorithms in Data Mining provides a description of each algorithm, discusses its impact, and reviews current and future research. Thoroughly evaluated by independent reviewers, each chapter focuses on a particular algorithm and is written by either the original authors of the algorithm or world-class researchers who have extensively studied the respective algorithm.The book concentrates on the following important algorithms: C4.5, k-Means, SVM, Apriori, EM, PageRank, AdaBoost, kNN, Naive Bayes, and CART. Examples illustrate how each algorithm works and highlight its overall performance in a real-world application. The text covers key topics—including classification, clustering, statistical learning, association analysis, and link mining—in data mining research and development as well as in data mining, machine learning, and artificial intelligence courses. By naming the leading algorithms in this field, this book encourages the use of data mining techniques in a broader realm of real-world applications. It should inspire more data mining researchers to further explore the impact and novel research issues of these algorithms.
R 6,660.79
Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation
This book constitutes the refereed proceedings of the 13th International Conference entitled Beyond Databases, Architectures and Structures, BDAS 2017, held in Ustroń, Poland, in May/June 2017.It consists of 44 carefully reviewed papers selected from 118 submissions. The papers are organized in topical sections, namely big data and cloud computing; artificial intelligence, data mining and knowledge discovery; architectures, structures and algorithms for efficient data processing; text mining, natural language processing, ontologies and semantic web; bioinformatics and biological data analysis; industrial applications; data mining tools, optimization and compression.
R 2,221.94
Bio-inspired Algorithms for Data Streaming and Visualization, Big Data Management, and Fog Computing
This book aims to provide some insights into recently developed bio-inspired algorithms within recent emerging trends of fog computing, sentiment analysis, and data streaming as well as to provide a more comprehensive approach to the big data management from pre-processing to analytics to visualization phases. The subject area of this book is within the realm of computer science, notably algorithms (meta-heuristic and, more particularly, bio-inspired algorithms). Although application domains of these new algorithms may be mentioned, the scope of this book is not on the application of algorithms to specific or general domains but to provide an update on recent research trends for bio-inspired algorithms within a specific application domain or emerging area. These areas include data streaming, fog computing, and phases of big data management. One of the reasons for writing this book is that the bio-inspired approach does not receive much attention but shows considerable promise and diversity in terms of approach of many issues in big data and streaming. Some novel approaches of this book are the use of these algorithms to all phases of data management (not just a particular phase such as data mining or business intelligence as many books focus on); effective demonstration of the effectiveness of a selected algorithm within a chapter against comparative algorithms using the experimental method. Another novel approach is a brief overview and evaluation of traditional algorithms, both sequential and parallel, for use in data mining, in order to provide an overview of existing algorithms in use. This overview complements a further chapter on bio-inspired algorithms for data mining to enable readers to make a more suitable choice of algorithm for data mining within a particular context. In all chapters, references for further reading are provided, and in selected chapters, the author also include ideas for future research.
R 5,688.42
Topological Data Structures for Surfaces
In Geography and GIS, surfaces can be analysed and visualised through various data structures, and topological data structures describe surfaces in the form of a relationship between certain surface-specific features. Drawn from many disciplines with a strong applied aspect, this is a research-led, interdisciplinary approach to the creation, analysis and visualisation of surfaces, focussing on topological data structures. Topological Data Structures for Surfaces: an introduction for Geographical Information Science describes the concepts and applications of these data structures. The book focuses on how these data structures can be used to analyse and visualise surface datasets from a range of disciplines such as human geography, computer graphics, metrology, and physical geography. Divided into two Parts, Part I defines the topological surface data structures and explains the various automated methods used for their generation. Part II demonstrates a number of applications of surface networks in diverse fields, ranging from sub-atomic particle collision visualisation to the study of population density patterns. To ensure that the material is accessible, each Part is prefaced by an overview of the techniques and application. Provides GI scientists and geographers with an accessible overview of current surface topology research.Algorithms are presented and explained with practical examples of their usage.Features an accompanying website developed by the Editor - http://geog.le.ac.uk/sanjayrana/surface-networks/ This book is invaluable for researchers and postgraduate students working in departments of GI Science, Geography and Computer Science. It also constitutes key reference material for Masters students working on surface analysis projects as part of a GI Science or Computer Science programme.
R 6,381.00
R 1,627.00
Algorithms and Applications
This book presents the proceedings of the Conference on Algorithms and Applications (ALAP 2018), which focuses on various areas of computing, like distributed systems and security, big data and analytics and very-large-scale integration (VLSI) design. The book provides solutions to a broad class of problems in diverse areas of algorithms in our daily lives in a world designed for, and increasingly controlled by algorithms. Written by eminent personalities from academia and industry, the papers included offer insights from a number of perspectives, providing an overview of the state of the art in the field. The book consists of invited talks by respected speakers, papers presented in technical sessions, and tutorials to offer ideas, results, work-in-progress and experiences of various algorithmic aspects of computational science and engineering.
R 8,014.34
Algorithms and Architectures for Parallel Processing
The four-volume set LNCS 11334-11337 constitutes the proceedings of the 18th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2018, held in Guangzhou, China, in November 2018.The 141 full and 50 short papers presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on Distributed and Parallel Computing; High Performance Computing; Big Data and Information Processing; Internet of Things and Cloud Computing; and Security and Privacy in Computing.
R 2,235.02
Algorithms and Theory of Computation Handbook, Volume 1
Algorithms and Theory of Computation Handbook, Second Edition: General Concepts and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. Along with updating and revising many of the existing chapters, this second edition contains four new chapters that cover external memory and parameterized algorithms as well as computational number theory and algorithmic coding theory. This best-selling handbook continues to help computer professionals and engineers find significant information on various algorithmic topics. The expert contributors clearly define the terminology, present basic results and techniques, and offer a number of current references to the in-depth literature. They also provide a glimpse of the major research issues concerning the relevant topics.
R 4,866.19
Algorithms and Applications
This book presents the proceedings of the Conference on Algorithms and Applications (ALAP 2018), which focuses on various areas of computing, like distributed systems and security, big data and analytics and very-large-scale integration (VLSI) design. The book provides solutions to a broad class of problems in diverse areas of algorithms in our daily lives in a world designed for, and increasingly controlled by algorithms. Written by eminent personalities from academia and industry, the papers included offer insights from a number of perspectives, providing an overview of the state of the art in the field. The book consists of invited talks by respected speakers, papers presented in technical sessions, and tutorials to offer ideas, results, work-in-progress and experiences of various algorithmic aspects of computational science and engineering.
R 7,895.32
R 543.00
Java Data Mining: Strategy, Standard, and Practice
Whether you are a software developer, systems architect, data analyst, or business analyst, if you want to take advantage of data mining in the development of advanced analytic applications, Java Data Mining, JDM, the new standard now implemented in core DBMS and data mining/analysis software, is a key solution component. This book is the essential guide to the usage of the JDM standard interface, written by contributors to the JDM standard.
R 2,000.00
Combinatorial Algorithms
This book constitutes the thoroughly refereed post-workshop proceedings of the 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry, as well as Graph Drawing and Graph Theory. IWOCA is a yearly forum for researchers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S.
R 2,188.29
Combinatorial Algorithms
This book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.
R 2,205.20
Algorithms and Programming
This text is structured in a problem-solution format that requires the student to think through the programming process. New to the second edition are additional chapters on suffix trees, games and strategies, and Huffman coding as well as an Appendix illustrating the ease of conversion from Pascal to C.
R 2,261.86
Algorithms and Architectures for Parallel Processing
The four-volume set LNCS 11334-11337 constitutes the proceedings of the 18th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2018, held in Guangzhou, China, in November 2018.The 141 full and 50 short papers presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on Distributed and Parallel Computing; High Performance Computing; Big Data and Information Processing; Internet of Things and Cloud Computing; and Security and Privacy in Computing.
R 2,238.09
OpenVMS Alpha Internals and Data Structures
OpenVMS Alpha Internals and Data Structures: Memory Management is an updateto selected parts of the book OpenVMS AXP Internals and Data Structures Version 1.5 (Digital Press, 1994). This book covers the extensions to the memory management subsystem of OpenVMS Alpha to allow the operating system and applications to access 64 bits of address space. It emphasizes system data structures and their manipulation by paging and swapping routines and related system services.It also describes management of dynamic memory, such as nonpaged pool, and support for nonuniform memory access (NUMA) platforms.This book is intended for systems programmers, technical consultants, application designers, and other computer progressions interested in learning the details of the OpenVMS executive. Teachers and students of graduate and advanced undergraduate courses in operating systems will find this book a valuable study in how theory and practice are resolved in a complex commercialoperating system.
R 3,620.00
WALCOM: Algorithms and Computation
This book constitutes the refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020. The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions. The papers focus on algorithmic graph theory and combinatorics, computational biology, computational geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, network optimization.
R 2,947.48
Python Data Structures Pocket Primer
As part of the best-selling Pocket Primer series, this book is designed to present the fundamentals of data structures using Python. Data structures provide a means to managing huge amounts of information such as large databases and the ability to use search and sort algorithms effectively. It is intended to be a fast-paced introduction to the core concepts of Python and data structures, illustrated with numerous code samples. Companion files with source code are available for downloading.
R 911.00
Algorithms and Architectures for Parallel Processing
The four-volume set LNCS 11334-11337 constitutes the proceedings of the 18th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2018, held in Guangzhou, China, in November 2018.The 141 full and 50 short papers presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on Distributed and Parallel Computing; High Performance Computing; Big Data and Information Processing; Internet of Things and Cloud Computing; and Security and Privacy in Computing.
R 2,234.27
Algorithms and Architectures for Parallel Processing
The three volume set LNCS 13155, 13156, and 13157 constitutes the refereed proceedings of the 21st International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2021, which was held online during December 3-5, 2021. The total of 145 full papers included in these proceedings were carefully reviewed and selected from 403 submissions. They cover the many dimensions of parallel algorithms and architectures including fundamental theoretical approaches, practical experimental projects, and commercial components and systems. The papers were organized in topical sections as follows:Part I, LNCS 13155: Deep learning models and applications; software systems and efficient algorithms; edge computing and edge intelligence; service dependability and security algorithms; data science; Part II, LNCS 13156: Software systems and efficient algorithms; parallel and distributed algorithms and applications; data science; edge computing and edge intelligence; blockchain systems; deept learning models and applications; IoT; Part III, LNCS 13157: Blockchain systems; data science; distributed and network-based computing; edge computing and edge intelligence; service dependability and security algorithms; software systems and efficient algorithms.
R 4,739.09
Introduction To The Analysis Of Algorithms, An (3rd Edition)
A successor to the first and second editions, this updated and revised book is a leading companion guide for students and engineers alike, specifically software engineers who design algorithms. While succinct, this edition is mathematically rigorous, covering the foundations for both computer scientists and mathematicians with interest in the algorithmic foundations of Computer Science.Besides expositions on traditional algorithms such as Greedy, Dynamic Programming and Divide & Conquer, the book explores two classes of algorithms that are often overlooked in introductory textbooks: Randomised and Online algorithms — with emphasis placed on the algorithm itself. The book also covers algorithms in Linear Algebra, and the foundations of Computation.The coverage of Randomized and Online algorithms is timely: the former have become ubiquitous due to the emergence of cryptography, while the latter are essential in numerous fields as diverse as operating systems and stock market predictions.While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds, as well as all the necessary mathematical foundations. The programming exercises in Python will be available on the web (see www.msoltys.com/book for the companion web site).
R 3,513.76
Algorithms and Complexity
This book constitutes the refereed proceedings of the 13th International Conference on Algorithms and Complexity, CIAC 2023, which took place in Larnaca, Cyprus, during June 13–16, 2023. The 25 full papers included in this book were carefully reviewed and selected from 49 submissions. They cover all important areas of research on algorithms and complexity such as algorithm design and analysis; sequential, parallel and distributed algorithms; data structures; computational and structural complexity; lower bounds and limitations of algorithms; randomized and approximation algorithms; parameterized algorithms and parameterized complexity classes; smoothed analysis of algorithms; alternatives to the worst-case analysis of algorithms (e.g., algorithms with predictions), on-line computation and competitive analysis, streaming algorithms, quantum algorithms and complexity, algorithms in algebra, geometry, number theory and combinatorics, computational geometry, algorithmic game theory and mechanism design, algorithmic economics (including auctions and contests), computational learning theory, computational biology and bioinformatics, algorithmic issues in communication networks, algorithms for discrete optimization (including convex optimization) and algorithm engineering.
R 3,337.05
Algorithms and Architectures for Parallel Processing
This fourvolume set LNCS 9528, 9529, 9530 and 9531 constitutes the refereed proceedingsof the 15th International Conference on Algorithms and Architectures for ParallelProcessing, ICA3PP 2015, held in Zhangjiajie, China, in November 2015.The 219revised full papers presented together with 77 workshop papers in these fourvolumes were carefully reviewed and selected from 807 submissions (602 fullpapers and 205 workshop papers). The first volume comprises the followingtopics: parallel and distributed architectures; distributed and network-basedcomputing and internet of things and cyber-physical-social computing. Thesecond volume comprises topics such as big data and its applications andparallel and distributed algorithms. The topics of the third volume are:applications of parallel and distributed computing and service dependabilityand security in distributed and parallel systems. The covered topics of the fourthvolume are: software systems and programming models and performance modelingand evaluation.
R 2,252.94
Algorithms for Data Science
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.
R 3,663.00
Algorithms and Architectures for Parallel Processing
This four volume set LNCS 9528, 9529, 9530 and 9531 constitutes the refereed proceedings of the 15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015, held in Zhangjiajie, China, in November 2015. The 219 revised full papers presented together with 77 workshop papers in these four volumes were carefully reviewed and selected from 807 submissions (602 full papers and 205 workshop papers). The first volume comprises the following topics: parallel and distributed architectures; distributed and network-based computing and internet of things and cyber-physical-social computing. The second volume comprises topics such as big data and its applications and parallel and distributed algorithms. The topics of the third volume are: applications of parallel and distributed computing and service dependability and security in distributed and parallel systems. The covered topics of the fourth volume are: software systems and programming models and performance modeling and evaluation.
R 4,361.40
Algorithms and Architectures for Parallel Processing
The six-volume set, LNCS 15251-15256, constitutes the refereed proceedings of the 24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024, held in Macau, China, during October 29-31, 2024. The 91 full papers, 35 short papers and 5 workshop papers included in these proceedings were carefully reviewed and selected from 265 submissions. They focus on the many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems.
R 2,949.67
Algorithmic Aspects in Information and Management
This volume constitutes the proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, AAIM 2016, held in Bergamo, Italy, in July 2016.The 18 revised full papers presented were carefully reviewed and selected from 41 submissions. The papers deal with current trends of research on algorithms, data structures, operation research, combinatorial optimization and their applications.
R 2,163.89
Algorithms and Architectures for Parallel Processing
The six-volume set, LNCS 15251-15256, constitutes the refereed proceedings of the 24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024, held in Macau, China, during October 29-31, 2024. The 91 full papers, 35 short papers and 5 workshop papers included in these proceedings were carefully reviewed and selected from 265 submissions. They focus on the many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems.
R 2,949.98
R 1,713.92
Algorithms for Constructing Computably Enumerable Sets
Logicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists.Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called "classical recursion theory"). This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems. These algorithms are little-known outside of a niche within the mathematical logic community. By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal.Topics and features:· All other books in this field focus on the mathematical results, rather than on the algorithms.· There are many exercises here, most of which relate to details of the algorithms.· The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature.· The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms.· In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas.Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it.Kenneth J. Supowit is an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US.
R 2,232.40
Algorithms and Architectures for Parallel Processing
The two-volume set LNCS 11944-11945 constitutes the proceedings of the 19th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2019, held in Melbourne, Australia, in December 2019. The 73 full and 29 short papers presented were carefully reviewed and selected from 251 submissions. The papers are organized in topical sections on: Parallel and Distributed Architectures, Software Systems and Programming Models, Distributed and Parallel and Network-based Computing, Big Data and its Applications, Distributed and Parallel Algorithms, Applications of Distributed and Parallel Computing, Service Dependability and Security, IoT and CPS Computing, Performance Modelling and Evaluation.
R 2,244.70
Scientific Data Analysis using Jython Scripting and Java
Scientific Data Analysis using Jython Scripting and Java presents practical approaches for data analysis using Java scripting based on Jython, a Java implementation of the Python language. The chapters essentially cover all aspects of data analysis, from arrays and histograms to clustering analysis, curve fitting, metadata and neural networks. A comprehensive coverage of data visualisation tools implemented in Java is also included.Written by the primary developer of the jHepWork data-analysis framework, the book provides a reliable and complete reference source laying the foundation for data-analysis applications using Java scripting. More than 250 code snippets (of around 10-20 lines each) written in Jython and Java, plus several real-life examples help the reader develop a genuine feeling for data analysis techniques and their programming implementation. This is the first data-analysis and data-mining book which is completely based on the Jython language, and opens doors to scripting using a fully multi-platform and multi-threaded approach. Graduate students and researchers will benefit from the information presented in this book.
R 1,582.06
Composite Data Structures and Modularization
This book covers C-Programming focussing on its practical side. Volume 2 deals mainly with composite data structures and their composition. An extensive use of figures and examples help to give a clear description of concepts and help the reader to gain a systematic understanding of the programming language.
R 1,345.00
Experimental Algorithms
This volume contains the papers presented at the 8th International Symposium on Experimental Algorithms (SEA 2009).The symposium was held at the Te- nische Universit. at Dortmund, Germany, during June 4-6, 2009. The main theme of the SEA series is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. Contributions are supported by experimental evaluation, methodological issues in the design and interpretation of experiments, the use of (meta-)heuristics, or application-driven case studies that deepen the und- standing of a problem's complexity. For each symposium, papers are solicited from all areas of algorithmic engineering research. Previous meetings, under the name of "Workshop on Experimental Al- rithms" (WEA), were held in Riga (Latvia, 2001), Ascona (Switzerland, 2003), Angra dos Reis (Brazil, 2004), Santorini (Greece, 2005), Menorca Island (Spain, 2006), Rome (Italy, 2007), and Provincetown (USA, 2008). The ProgramCommittee ofSEA 2009received64 submissions.Eachsubm- sion was reviewed by at least three ProgramCommittee members and evaluated on its quality,originality,and relevance to the symposium.Overall,the Program Committee wrote249 reviews with the help of almost 100 trusted external ref- ees. The Committee selected 23 papers, leading to an acceptance rate of 35.9%. The decision process was made electronically using the EasyChair conference management system. In additionto the accepted contributions,this volumealso containsabstracts ofthe invitedtalks givenby Heinz Bast(Intel), MichaelA. Bender (Stony Brook University and Tokutek, Inc.), and Marc Schoenauer (INRIA Saclay - Ile-de- France).
R 2,365.14
Python Algorithms
Python Algorithms explains the Python approach to algorithm analysis and design. Written by Magnus Lie Hetland, author of Beginning Python, this book is sharply focused on classical algorithms, but it also gives a solid understanding of fundamental algorithmic problem-solving techniques. The book deals with some of the most important and challenging areas of programming and computer science, but in a highly pedagogic and readable manner. The book covers both algorithmic theory and programming practice, demonstrating how theory is reflected in real Python programs. Well-known algorithms and data structures that are built into the Python language are explained, and the user is shown how to implement and evaluate others himself.
R 2,082.80
R 1,270.00
Parallel Architecture, Algorithm and Programming
This book constitutes the refereed proceedings of the 8th International Symposium on Parallel Architecture, Algorithm and Programming, PAAP 2017, held in Haikou, China, in June 2017. The 50 revised full papers and 7 revised short papers presented were carefully reviewed and selected from 192 submissions. The papers deal with research results and development activities in all aspects of parallel architectures, algorithms and programming techniques.
R 1,612.65
How to Think about Algorithms
Understand algorithms and their design with this revised student-friendly textbook. Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable. Without grinding through lots of formal proof, students will benefit from step-by-step methods for developing algorithms, expert guidance on common pitfalls, and an appreciation of the bigger picture. Revised and updated, this second edition includes a new chapter on machine learning algorithms, and concise key concept summaries at the end of each part for quick reference. Also new to this edition are more than 150 new exercises: selected solutions are included to let students check their progress, while a full solutions manual is available online for instructors. No other text explains complex topics such as loop invariants as clearly, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.
R 5,932.56
Algorithms and Architectures for Parallel Processing
The six-volume set, LNCS 15251-15256, constitutes the refereed proceedings of the 24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024, held in Macau, China, during October 29-31, 2024. The 91 full papers, 35 short papers and 5 workshop papers included in these proceedings were carefully reviewed and selected from 265 submissions. They focus on the many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems.
R 2,945.70
Algorithms and Architectures for Parallel Processing
The six-volume set, LNCS 15251-15256, constitutes the refereed proceedings of the 24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024, held in Macau, China, during October 29-31, 2024. The 91 full papers, 35 short papers and 5 workshop papers included in these proceedings were carefully reviewed and selected from 265 submissions. They focus on the many dimensions of parallel algorithms and architectures, encompassing fundamental theoretical approaches, practical experimental projects, and commercial components and systems.
R 2,946.60
Geometric Structures of Information
This book focuses on information geometry manifolds of structured data/information and their advanced applications featuring new and fruitful interactions between several branches of science: information science, mathematics and physics. It addresses interrelations between different mathematical domains like shape spaces, probability/optimization & algorithms on manifolds, relational and discrete metric spaces, computational and Hessian information geometry, algebraic/infinite dimensional/Banach information manifolds, divergence geometry, tensor-valued morphology, optimal transport theory, manifold & topology learning, and applications like geometries of audio-processing, inverse problems and signal processing.The book collects the most important contributions to the conference GSI’2017 – Geometric Science of Information.
R 7,430.06
Algorithms and Architectures for Parallel Processing
This two volume set LNCS 8285 and 8286 constitutes the proceedings of the 13th International Conference on Algorithms and Architectures for Parallel Processing , ICA3PP 2013, held in Vietri sul Mare, Italy in December 2013. The first volume contains 10 distinguished and 31 regular papers selected from 90 submissions and covering topics such as big data, multi-core programming and software tools, distributed scheduling and load balancing, high-performance scientific computing, parallel algorithms, parallel architectures, scalable and distributed databases, dependability in distributed and parallel systems, wireless and mobile computing. The second volume consists of four sections including 35 papers from one symposium and three workshops held in conjunction with ICA3PP 2013 main conference. These are 13 papers from the 2013 International Symposium on Advances of Distributed and Parallel Computing (ADPC 2013), 5 papers of the International Workshop on Big Data Computing (BDC 2013), 10 papers of the International Workshop on Trusted Information in Big Data (TIBiDa 2013) as well as 7 papers belonging to Workshop on Cloud-assisted Smart Cyber-Physical Systems (C-Smart CPS 2013).
R 1,563.43
Modern Algorithms of Cluster Analysis
This book provides the reader with a basic understanding of the formal concepts of the cluster, clustering, partition, cluster analysis etc. The book explains feature-based, graph-based and spectral clustering methods and discusses their formal similarities and differences. Understanding the related formal concepts is particularly vital in the epoch of Big Data; due to the volume and characteristics of the data, it is no longer feasible to predominantly rely on merely viewing the data when facing a clustering problem. Usually clustering involves choosing similar objects and grouping them together. To facilitate the choice of similarity measures for complex and big data, various measures of object similarity, based on quantitative (like numerical measurement results) and qualitative features (like text), as well as combinations of the two, are described, as well as graph-based similarity measures for (hyper) linked objects and measures for multilayered graphs. Numerous variants demonstrating how such similarity measures can be exploited when defining clustering cost functions are also presented. In addition, the book provides an overview of approaches to handling large collections of objects in a reasonable time. In particular, it addresses grid-based methods, sampling methods, parallelization via Map-Reduce, usage of tree-structures, random projections and various heuristic approaches, especially those used for community detection.
R 7,730.84
Algorithms
This is the proceedings of the SIGAL International Symposium on Algorithms held at CSK Information Education Center, Tokyo, Japan, August 16-18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year. This symposium is the first international symposium organized by SIGAL. In response to the call for papers, 88 papers were submitted from around the world. The program committee selected 34 for presentation at the symposium. The symposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra.
R 1,587.07
