Search results for "Python Exercises with Data Structures and Algorithms"
Items we need to order for you
Programming Computer Vision with Python
If you want a basic understanding of computer vision's underlying theory and algorithms, this hands-on introduction is the ideal place to start. As a student, researcher, hacker, or enthusiast, you'll learn as you follow examples written in Python - the easy-to-learn language that has modules for handling images and mathematical computing and data mining on a par with commercial alternatives. Programming Computer Vision with Python teaches computer vision in broad terms that won't bog you down in theory. Instead, you'll find this book to be inspiring and motivating. You'll get all the code you need, with clear explanations on how to reproduce the book's examples and build upon them directly.
R 1,368.00
Concise Introduction to Machine Learning
A Concise Introduction to Machine Learning uses mathematics as the common language to explain a variety of machine learning concepts from basic principles and illustrates every concept using examples in both Python and MATLAB®, which are available on GitHub and can be run from there in Binder in a web browser. Each chapter concludes with exercises to explore the content.The emphasis of the book is on the question of Why—only if “why” an algorithm is successful is understood, can it be properly applied and the results trusted. Standard techniques are treated rigorously, including an introduction to the necessary probability theory. This book addresses the commonalities of methods, aims to give a thorough and in-depth treatment and develop intuition for the inner workings of algorithms, while remaining concise.This useful reference should be essential on the bookshelf of anyone employing machine learning techniques, since it is born out of strong experience in university teaching and research on algorithms, while remaining approachable and readable.
R 8,335.25
Algorithms and Discrete Applied Mathematics
This book collects the refereed proceedingsof the Second International Conference on Algorithms and Discrete AppliedMathematics, CALDAM 2016, held in Thiruvananthapuram, India, in February 2016.The volume contains 30 full revised papers from 90 submissions along with 1invited talk presented at the conference. The conference focuses on topicsrelated to efficient algorithms and data structures, their analysis (boththeoretical and experimental) and the mathematical problems arising thereof,and new applications of discrete mathematics, advances in existing applicationsand development of new tools for discrete mathematics.
R 2,187.26
VLSI Architecture for Concurrent Data Structures
Concurrent data structures simplify the development of concurrent programs by encapsulating commonly used mechanisms for synchronization and commu nication into data structures. This thesis develops a notation for describing concurrent data structures, presents examples of concurrent data structures, and describes an architecture to support concurrent data structures. Concurrent Smalltalk (CST), a derivative of Smalltalk-80 with extensions for concurrency, is developed to describe concurrent data structures. CST allows the programmer to specify objects that are distributed over the nodes of a concurrent computer. These distributed objects have many constituent objects and thus can process many messages simultaneously. They are the foundation upon which concurrent data structures are built. The balanced cube is a concurrent data structure for ordered sets. The set is distributed by a balanced recursive partition that maps to the subcubes of a binary 7lrcube using a Gray code. A search algorithm, VW search, based on the distance properties of the Gray code, searches a balanced cube in O(log N) time. Because it does not have the root bottleneck that limits all tree-based data structures to 0(1) concurrency, the balanced cube achieves 0C.:N) con currency. Considering graphs as concurrent data structures, graph algorithms are pre sented for the shortest path problem, the max-flow problem, and graph parti tioning. These algorithms introduce new synchronization techniques to achieve better performance than existing algorithms.
R 4,649.45
R 704.00
R 764.00
R 641.00
R 1,278.69
Statistical Learning with Math and Python
The most crucial ability for machine learning and data science is mathematical logic for grasping their essence rather than knowledge and experience. This textbook approaches the essence of machine learning and data science by considering math problems and building Python programs.As the preliminary part, Chapter 1 provides a concise introduction to linear algebra, which will help novices read further to the following main chapters. Those succeeding chapters present essential topics in statistical learning: linear regression, classification, resampling, information criteria, regularization, nonlinear regression, decision trees, support vector machines, and unsupervised learning. Each chapter mathematically formulates and solves machine learning problems and builds the programs. The body of a chapter is accompanied by proofs and programs in an appendix, with exercises at the end of the chapter. Because the book is carefully organized to provide the solutions to the exercises in each chapter, readers can solve the total of 100 exercises by simply following the contents of each chapter.This textbook is suitable for an undergraduate or graduate course consisting of about 12 lectures. Written in an easy-to-follow and self-contained style, this book will also be perfect material for independent learning.
R 1,649.00
Data Analysis and Visualization Using Python
Look at Python from a data science point of view and learn proven techniques for data visualization as used in making critical business decisions. Starting with an introduction to data science with Python, you will take a closer look at the Python environment and get acquainted with editors such as Jupyter Notebook and Spyder. After going through a primer on Python programming, you will grasp fundamental Python programming techniques used in data science. Moving on to data visualization, you will see how it caters to modern business needs and forms a key factor in decision-making. You will also take a look at some popular data visualization libraries in Python. Shifting focus to data structures, you will learn the various aspects of data structures from a data science perspective. You will then work with file I/O and regular expressions in Python, followed by gathering and cleaning data. Moving on to exploring and analyzing data, you will look at advanced data structures in Python. Then, you will take a deep dive into data visualization techniques, going through a number of plotting systems in Python. In conclusion, you will complete a detailed case study, where you’ll get a chance to revisit the concepts you’ve covered so far.What You Will LearnUse Python programming techniques for data scienceMaster data collections in Python Create engaging visualizations for BI systemsDeploy effective strategies for gathering and cleaning dataIntegrate the Seaborn and Matplotlib plotting systemsWho This Book Is ForDevelopers with basic Python programming knowledge looking to adopt key strategies for data analysis and visualizations using Python.
R 1,975.76
Beginner's Guide to Code Algorithms
Do you have creative ideas that you wish you could transform into code?Do you want to boost your problem solving and logic skills?Do you want to enhance your career by adopting an algorithmic mindset?In our increasingly digital world, coding is an essential skill. Communicating an algorithm to a machine to perform a set of tasks is vital. Beginner’s Guide to Code Algorithms: Experiments to Enhance Productivity and Solve Problems written by Deepankar Maitra teaches you how to think like a programmer. The author unravels the secret behind writing code – building a good algorithm. Algorithmic thinking leads to asking the right question and enables a shift from issue resolution to value creation. Having this mindset will make you more marketable to employers. This book takes you on a problem-solving journey to expand your mind and increase your willingness to experiment with code. You will: Learn the art of building an algorithm through hands-on exercises Understand how to develop code for inspiring productivity concepts Build a mentality of developing algorithms to solve problems Develop, test, review, and improve code through guided experimentationThis book is designed to develop a culture of logical thinking through intellectual stimulation. It will benefit students and teachers of programming, business professionals, as well as experienced users of Microsoft Excel who wish to become proficient with macros.
R 7,563.08
R 1,303.00
Algorithms
An accessible introduction to algorithms, explaining not just what they are but how they work, with examples from a wide range of application areas.Digital technology runs on algorithms, sets of instructions that describe how to do something efficiently. Application areas range from search engines to tournament scheduling, DNA sequencing, and machine learning. Arguing that every educated person today needs to have some understanding of algorithms and what they do, in this volume in the MIT Press Essential Knowledge series, Panos Louridas offers an introduction to algorithms that is accessible to the nonspecialist reader. Louridas explains not just what algorithms are but also how they work, offering a wide range of examples and keeping mathematics to a minimum. After discussing what an algorithm does and how its effectiveness can be measured, Louridas covers three of the most fundamental applications areas: graphs, which describe networks, from eighteenth-century problems to today's social networks; searching, and how to find the fastest way to search; and sorting, and the importance of choosing the best algorithm for particular tasks. He then presents larger-scale applications: PageRank, Google's founding algorithm; and neural networks and deep learning. Finally, Louridas describes how all algorithms are nothing more than simple moves with pen and paper, and how from such a humble foundation rise all their spectacular achievements.
R 387.00
R 1,254.00
Analysis and Design of Algorithms
Analysis and Design of Algorithms provides a structured view of algorithm design techniques in a concise, easy-to-read manner. The book was written with an express purpose of being easy — to understand, read, and carry.It presents a pioneering approach in the teaching of algorithms, based on learning algorithm design techniques, and not merely solving a collection of problems. This allows students to master one design technique at a time and apply it to a rich variety of problems.Analysis and Design of Algorithms covers the algorithmic design techniques of divide and conquer, greedy, dynamic programming, branch and bound, and graph traversal. For each of these techniques, there are templates and guidelines on when to use and not to use each technique. Many sections contain innovative mnemonics to aid the readers in remembering the templates and key takeaways. Additionally, the book covers NP-completeness and the inherent hardness of problems. The third edition includes a new section on polynomial multiplication, as well as additional exercise problems, and an updated appendix.Written with input from students and professionals, Analysis and Design of Algorithms is well suited for introductory algorithm courses at the undergraduate and graduate levels. The structured organization of the text makes it especially appropriate for online and distance learning.
R 4,803.12
Algorithms - ESA'99
The 7th Annual European Symposium on Algorithms (ESA ’99) is held in Prague, Czech Republic, July 16-18, 1999. This continued the tradition of the meetings which were held in – 1993 Bad Honnef (Germany) – 1994 Utrecht (Netherlands) – 1995 Corfu (Greece) – 1996 Barcelona (Spain) – 1997 Graz (Austria) – 1998 Venice (Italy) (The proceedingsof previousESA meetings were publishedas Springer LNCS v- umes 726, 855, 979, 1136, 1284, 1461.) In the short time of its history ESA (like its sister meeting SODA) has become a popular and respected meeting. The call for papers stated that the “Symposium covers research in the use, design, and analysis of ef?cient algorithms and data structures as it is carried out in c- puter science, discrete applied mathematics and mathematical programming. Papers are solicited describing original results in all areas of algorithmic research, including but not limited to: Approximation Algorithms; Combinatorial Optimization; Compu- tional Biology; Computational Geometry; Databases and Information Retrieval; Graph and Network Algorithms; Machine Learning; Number Theory and Computer Algebra; On-line Algorithms; Pattern Matching and Data Compression; Symbolic Computation.
R 3,081.70
Mastering Predictive Analytics with Python
Exploit the power of data in your business by building advanced predictive modeling applications with PythonAbout This Book• Master open source Python tools to build sophisticated predictive models• Learn to identify the right machine learning algorithm for your problem with this forward-thinking guide• Grasp the major methods of predictive modeling and move beyond the basics to a deeper level of understandingWho This Book Is ForThis book is designed for business analysts, BI analysts, data scientists, or junior level data analysts who are ready to move from a conceptual understanding of advanced analytics to an expert in designing and building advanced analytics solutions using Python. You're expected to have basic development experience with Python.What You Will Learn • Gain an insight into components and design decisions for an analytical application• Master the use Python notebooks for exploratory data analysis and rapid prototyping• Get to grips with applying regression, classification, clustering, and deep learning algorithms• Discover the advanced methods to analyze structured and unstructured data• Find out how to deploy a machine learning model in a production environment• Visualize the performance of models and the insights they produce• Scale your solutions as your data grows using Python• Ensure the robustness of your analytic applications by mastering the best practices of predictive analysisIn DetailThe volume, diversity, and speed of data available has never been greater. Powerful machine learning methods can unlock the value in this information by finding complex relationships and unanticipated trends. Using the Python programming language, analysts can use these sophisticated methods to build scalable analytic applications to deliver insights that are of tremendous value to their organizations.In Mastering Predictive Analytics with Python, you will learn the process of turning raw data into powerful insights. Through case studies and code examples using popular open-source Python libraries, this book illustrates the complete development process for analytic applications and how to quickly apply these methods to your own data to create robust and scalable prediction services.Covering a wide range of algorithms for classification, regression, clustering, as well as cutting-edge techniques such as deep learning, this book illustrates not only how these methods work, but how to implement them in practice. You will learn to choose the right approach for your problem and how to develop engaging visualizations to bring the insights of predictive modeling to lifeStyle and approach This book emphasizes on explaining methods through example data and code, showing you templates that you can quickly adapt to your own use cases. It focuses on both a practical application of sophisticated algorithms and the intuitive understanding necessary to apply the correct method to the problem at hand. Through visual examples, it also demonstrates how to
R 1,889.00
Simulation with Python
Understand the theory and implementation of simulation. This book covers simulation topics from a scenario-driven approach using Python and rich visualizations and tabulations. The book discusses simulation used in the natural and social sciences and with simulations taken from the top algorithms used in the industry today. The authors use an engaging approach that mixes mathematics and programming experiments with beginning-intermediate level Python code to create an immersive learning experience that is cohesive and integrated. After reading this book, you will have an understanding of simulation used in natural sciences, engineering, and social sciences using Python.What You'll LearnUse Python and numerical computation to demonstrate the power of simulationChoose a paradigm to run a simulationDraw statistical insights from numerical experimentsKnow how simulation is used to solve real-world problems Who This Book Is ForEntry-level to mid-level Python developers from various backgrounds, including backend developers, academic research programmers, data scientists, and machine learning engineers. The book is also useful to high school students and college undergraduates and graduates with STEM backgrounds.
R 1,254.00
R 1,270.00
Time Series Algorithms Recipes
This book teaches the practical implementation of various concepts for time series analysis and modeling with Python through problem-solution-style recipes, starting with data reading and preprocessing. It begins with the fundamentals of time series forecasting using statistical modeling methods like AR (autoregressive), MA (moving-average), ARMA (autoregressive moving-average), and ARIMA (autoregressive integrated moving-average). Next, you'll learn univariate and multivariate modeling using different open-sourced packages like Fbprohet, stats model, and sklearn. You'll also gain insight into classic machine learning-based regression models like randomForest, Xgboost, and LightGBM for forecasting problems. The book concludes by demonstrating the implementation of deep learning models (LSTMs and ANN) for time series forecasting. Each chapter includes several code examples and illustrations. After finishing this book, you will have a foundational understanding of various concepts relating to time series and its implementation in Python. What You Will LearnImplement various techniques in time series analysis using Python.Utilize statistical modeling methods such as AR (autoregressive), MA (moving-average), ARMA (autoregressive moving-average) and ARIMA (autoregressive integrated moving-average) for time series forecasting Understand univariate and multivariate modeling for time series forecastingForecast using machine learning and deep learning techniques such as GBM and LSTM (long short-term memory) Who This Book Is ForData Scientists, Machine Learning Engineers, and software developers interested in time series analysis.
R 866.00
Experimental Algorithms
This book constitutes the refereed proceedings of the 13th International Symposium on Experimental Algorithms, SEA 2014, held in Copenhagen, Denmark, in June/July 2014.The 36 revised full papers presented together with 3 invited presentations were carefully reviewed and selected from 81 submissions. The papers are organized in topical sections on combinatorial optimization, data structures, graph drawing, shortest path, strings, graph algorithms and suffix structures.
R 2,201.21
WALCOM: Algorithms and Computation
This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016.The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide range of topics such as approximation algorithms, computational complexity, computational geometry, data structures, graph algorithms, graph coloring, graph exploration, and online algorithms.
R 2,187.26
Data Structures for Raster Graphics
Raster graphics differs from the more traditional vector or line graphics in the sense that images are not made up from line segments but from discrete elements orderly arranged in a two-dimensional rectangular region. There are two reasons for the growing popularity of raster graphics or bit-mapped displays: I) the possibilities they offer to show extremely realistic pictures 2) the dropping prices of those displays and associated processors and memories. With the rise of raster graphics, all kinds of new techniques, methods, algorithms and data representations are associated -such as ray tracing, raster operations, and quadtrees-bringing with them a lot of fruitful research. As stated above raster graphics allows to create extremely realistic (synthesized) pictures. There are important applications in such diverse areas as industrial deSign, flight Simulation, education, image processing and animation. Unfortunately many applications are hampered by the fact that with the present state of the art they reqUire an excessive amount of computing resources. Hence it is worthwhile to investigate methods and techniques which may be of help in redudng computer costs associated with raster graphics applications. Since the choice of data srtuc tures influences the efficiency of algorithms in a crudal way, a workshop was set up in order to bring together a (limited) number of experienced researchers to dis cuss this topic. The workshop was held from 24 to 28 June 1985 at Steensel, a tiny village in the neighbourhood of Eindhoven, the Netherlands.
R 4,335.32
Purely Functional Data Structures
Most books on data structures assume an imperative language like C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures from the point of view of functional languages, with examples, and presents design techniques so that programmers can develop their own functional data structures. It includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages. All source code is given in Standard ML and Haskell, and most of the programs can easily be adapted to other functional languages. This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study.
R 2,470.44
R 458.00
Exercises in Numerical Linear Algebra and Matrix Factorizations
To put the world of linear algebra to advanced use, it is not enough to merely understand the theory; there is a significant gap between the theory of linear algebra and its myriad expressions in nearly every computational domain. To bridge this gap, it is essential to process the theory by solving many exercises, thus obtaining a firmer grasp of its diverse applications. Similarly, from a theoretical perspective, diving into the literature on advanced linear algebra often reveals more and more topics that are deferred to exercises instead of being treated in the main text. As exercises grow more complex and numerous, it becomes increasingly important to provide supporting material and guidelines on how to solve them, supporting students’ learning process. This book provides precisely this type of supporting material for the textbook “Numerical Linear Algebra and Matrix Factorizations,” published as Vol. 22 of Springer’s Texts in Computational Science and Engineering series. Instead of omitting details or merely providing rough outlines, this book offers detailed proofs, and connects the solutions to the corresponding results in the textbook. For the algorithmic exercises the utmost level of detail is provided in the form of MATLAB implementations. Both the textbook and solutions are self-contained. This book and the textbook are of similar length, demonstrating that solutions should not be considered a minor aspect when learning at advanced levels.
R 2,015.00
R 599.00
Python 3 and Data Analytics
As part of the best-selling Pocket Primer series, this book is designed to introduce the reader to the basic concepts of data analytics using Python 3. It is intended to be a fast-paced introduction to some basic features of data analytics and also covers statistics, data visualization, and data cleaning. The book includes numerous code samples using NumPy, Pandas, Matplotlib, Seaborn, and features an appendix on regular expressions. Companion files with source code and color figures are available.FEATURES:Includes a concise introduction to Python 3.Provides a thorough introduction to data and data cleaning.Covers NumPy and Pandas.Introduces statistical concepts and data visualization (Matplotlib/Seaborn).Features an appendix on regular expressions.Includes companion files with source code and figures.
R 911.00
Learn coding with Python and JavaScript
Whether on the computer, tablet, mobile phone, in the car or in the coffee machine - computer programs determine our everyday life. Software is becoming increasingly important, hardly anything works without the mysterious power of algorithms. But how do programs work? And how do you develop them? This book teaches you the basics of programming. Using everyday examples, you will first learn the basic concepts of programming, which are similar in all programming languages. Based on these basic ideas, you will then learn two popular and very useful programming languages, Python and JavaScript, in a systematic way and with many practical exercises, which you can use for a wide range of different tasks. The book is aimed at novice programmers of all ages (from students to professionals) who have no previous programming experience.
R 2,381.00
Conceptual Structures: Theory and Implementation
This volume contains revised and expanded versions of paperspresented at the Seventh Annual Workshop on ConceptualGraphs, held at New Mexico State University in Las Cruces,and sponsored by the American Association for ArtificialIntelligence and the NMSU Computer Science Department. Thecontents of the volume fall in the areas of representationissues, reasoning, data modeling and databases, algorithmsand tools, and applications and natural language. One of thehighlights reported in the volume is the landmark meetingof the first PEIRCE Project Workshop. The PEIRCE Projectaims to build a state-of-the-art, industrial strengthconceptual graphs workbench.
R 1,564.16
Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms
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 structures, as well as the algorithms needed to render implicit curves and surfaces, and shows how implicit objects can easily describe smooth, intricate, and articulatable shapes, and hence why they are being increasingly used in graphical applications. Divided into two parts, the first introduces the mathematics of implicit curves and surfaces, as well as the data structures suited to store their sampled or discrete approximations, and the second deals with different computational methods for sampling implicit curves and surfaces, with particular reference to how these are applied to functions in 2D and 3D spaces.
R 3,950.94
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
Concise Introduction to Machine Learning
A Concise Introduction to Machine Learning uses mathematics as the common language to explain a variety of machine learning concepts from basic principles and illustrates every concept using examples in both Python and MATLAB®, which are available on GitHub and can be run from there in Binder in a web browser. Each chapter concludes with exercises to explore the content.The emphasis of the book is on the question of Why—only if “why” an algorithm is successful is understood, can it be properly applied and the results trusted. Standard techniques are treated rigorously, including an introduction to the necessary probability theory. This book addresses the commonalities of methods, aims to give a thorough and in-depth treatment and develop intuition for the inner workings of algorithms, while remaining concise.This useful reference should be essential on the bookshelf of anyone employing machine learning techniques, since it is born out of strong experience in university teaching and research on algorithms, while remaining approachable and readable.
R 2,674.00
Algorithms and Computation
This book constitutes the refereed proceedings of the 26th InternationalSymposium on Algorithms and Computation, ISAAC 2015, held in Nagoya, Japan, inDecember 2015.The 65 revised full papers presented together with 3 invited talks were carefullyreviewed and selected from 180 submissions for inclusion in the book. The focusof the volume is on the following topics: computational geometry; datastructures; combinatorial optimization and approximation algorithms; randomizedalgorithms; graph algorithms and FPT; computational complexity; graph drawingand planar graphs; online and streaming algorithms; and string and DNAalgorithms.
R 3,974.33
Applied Algorithms
This book LNCS constitutes the refereed proceedings of the Second International Conference on Applied Algorithms, ICAA 2025, held in Kolkata, India, during January 8–10, 2025.The 26 full papers and 4 short papers are carefully reviewed and selected from 93 submissions. This conference sought original contributions related to the design, analysis, implementation, and experimental evaluation of efficient algorithms and data structures for problems.
R 2,954.81
Algorithms in a Nutshell, 2e
Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs-with just enough math to let you understand and analyze algorithm performance. With its focus on application, rather than theory, this book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each major algorithm is presented in the style of a design pattern that includes information to help you understand why and when the algorithm is appropriate.With this book, you will: Solve a particular coding problem or improve on the performance of an existing solution Quickly locate algorithms that relate to the problems you want to solve, and determine why a particular algorithm is the right one to use Get algorithmic solutions in C, C++, Java, and Ruby with implementation tips Learn the expected performance of an algorithm, and the conditions it needs to perform at its best Discover the impact that similar design decisions have on different algorithms Learn advanced data structures to improve the efficiency of algorithms
R 2,076.00
Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms
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 structures, as well as the algorithms needed to render implicit curves and surfaces, and shows how implicit objects can easily describe smooth, intricate, and articulatable shapes, and hence why they are being increasingly used in graphical applications. Divided into two parts, the first introduces the mathematics of implicit curves and surfaces, as well as the data structures suited to store their sampled or discrete approximations, and the second deals with different computational methods for sampling implicit curves and surfaces, with particular reference to how these are applied to functions in 2D and 3D spaces.
R 3,019.69
Algorithms and Complexity
Here are the refereed proceedings of the 6th Italian Conference on Algorithms and Computation, CIAC 2006. The 33 revised full papers presented together with 3 invited papers address such topics as sequential, parallel and distributed algorithms, data structures, approximation algorithms, randomized algorithms, on-line algorithms, graph algorithms, analysis of algorithms, algorithm engineering, algorithmic game theory, computational biology, computational complexity, communication networks, computational geometry, cryptography, discrete optimization, graph drawing, mathematical programming, and quantum algorithms.
R 1,574.14
Orange Book of Machine Learning Green Edition
Learn supervised machine learning for tabular data using Python, pandas, scikit-learn, CatBoost, LightGBM, XGBoost, TabPFN, and TabICL for regression, classification, and predictive modelingKey FeaturesExplore, clean, and prepare tabular datasets for machine learning workflowsBuild regression and classification models using modern machine learning toolsImprove predictions with calibration, conformal intervals, and optimization techniquesBook DescriptionMaster the essential tools and techniques for supervised machine learning on tabular data with this practical guide to regression and classification. Through clear explanations, code snippets, and hands-on notebooks, you'll learn how to use Python and leading machine learning libraries, including pandas, scikit-learn, CatBoost, LightGBM, XGBoost, TabPFN, and TabICL, to build predictive models for real-world datasets.The book covers the complete workflow, from data exploration and cleaning to model development, evaluation, and optimization. You'll learn how to perform regression analysis for accurate point predictions and estimate uncertainty using conformal prediction intervals. For classification tasks, you'll explore probabilistic predictions and calibration techniques to improve model reliability. You'll also discover practical approaches to feature engineering, feature selection, and hyperparameter optimization to enhance model performance. In addition, the book introduces tabular foundation models and in-context learning techniques, providing insight into the latest advances in machine learning for structured data.By the end of the book, you'll have the skills and confidence to develop, evaluate, and deploy supervised machine learning models for a wide range of tabular data applications.What you will learnPerform exploratory data analysis and data cleaningApply cross-validation for reliable model evaluationBuild regression models and prediction intervalsDevelop calibrated probabilistic classification modelsOptimize models through hyperparameter tuningEngineer and select features for improved performanceUse ensemble learning methods effectivelyExplore tabular foundation models and in-context learningWho this book is forThis book is designed for motivated self-learners, university students studying applied machine learning, junior data scientists, and academic researchers looking to incorporate machine learning into their analytical workflows. Readers should have a basic familiarity with Python and data analysis concepts. Whether you're developing predictive models for business, research, or educational purposes, this book provides the practical guidance needed to apply modern machine learning techniques to structured and tabular datasets.
R 1,303.00
R 1,293.00
R 412.00
Applied Algorithms
This book constitutes the refereed proceedings of the First International Conference on Applied Algorithms, ICAA 2014, held in Kolkata, India, in January 2014. ICAA is a new conference series with a mission to provide a quality forum for researchers working in applied algorithms. Papers presenting original contributions related to the design, analysis, implementation and experimental evaluation of efficient algorithms and data structures for problems with relevant real-world applications were sought, ideally bridging the gap between academia and industry. The 21 revised full papers presented together with 7 short papers were carefully reviewed and selected from 122 submissions.
R 2,175.34
Bioinformatics Algorithms
Bioinformatics Algorithms: Design and Implementation in Python provides a comprehensive book on many of the most important bioinformatics problems, putting forward the best algorithms and showing how to implement them. The book focuses on the use of the Python programming language and its algorithms, which is quickly becoming the most popular language in the bioinformatics field. Readers will find the tools they need to improve their knowledge and skills with regard to algorithm development and implementation, and will also uncover prototypes of bioinformatics applications that demonstrate the main principles underlying real world applications.
R 3,678.00
Algorithms: A Top-down Approach
This comprehensive compendium provides a rigorous framework to tackle the daunting challenges of designing correct and efficient algorithms. It gives a uniform approach to the design, analysis, optimization, and verification of algorithms. The volume also provides essential tools to understand algorithms and their associated data structures.This useful reference text describes a way of thinking that eases the task of proving algorithm correctness. Working through a proof of correctness reveals an algorithm's subtleties in a way that a typical description does not. Algorithm analysis is presented using careful definitions that make the analyses mathematically rigorous.Related Link(s)
R 2,418.24
