Search results for "data structures and algorithms in java"
Items we need to order for you
Algorithms for Communications Systems and their Applications
The definitive guide to problem-solving in the design of communications systems In Algorithms for Communications Systems and their Applications, 2nd Edition, authors Benvenuto, Cherubini, and Tomasin have delivered the ultimate and practical guide to applying algorithms in communications systems. Written for researchers and professionals in the areas of digital communications, signal processing, and computer engineering, Algorithms for Communications Systems presents algorithmic and computational procedures within communications systems that overcome a wide range of problems facing system designers. New material in this fully updated edition includes: MIMO systems (Space-time block coding/Spatial multiplexing /Beamforming and interference management/Channel Estimation)OFDM and SC-FDMA (Synchronization/Resource allocation (bit and power loading)/Filtered OFDM)Improved radio channel model (Doppler and shadowing/mmWave)Polar codes (including practical decoding methods)5G systems (New Radio architecture/initial access for mmWave/physical channels) The book retains the essential coding and signal processing theoretical and operative elements expected from a classic text, further adopting the new radio of 5G systems as a case study to create the definitive guide to modern communications systems.
R 5,372.00
Experimental Algorithms
This book constitutes the refereed proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013, held in Rome, Italy, in June 2013. The 32 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on transportation networks and graph algorithms, combinatorics and enumeration, data structures and compression, network partitioning and bioinformatics, mathematical programming, geometry and optimization, and scheduling and local search.
R 2,194.76
Algorithms and Architectures for Parallel Processing
This two volume set LNCS 8630 and 8631 constitutes the proceedings of the 14th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2014, held in Dalian, China, in August 2014. The 70 revised papers presented in the two volumes were selected from 285 submissions. The first volume comprises selected papers of the main conference and papers of the 1st International Workshop on Emerging Topics in Wireless and Mobile Computing, ETWMC 2014, the 5th International Workshop on Intelligent Communication Networks, IntelNet 2014, and the 5th International Workshop on Wireless Networks and Multimedia, WNM 2014. The second volume comprises selected papers of the main conference and papers of the Workshop on Computing, Communication and Control Technologies in Intelligent Transportation System, 3C in ITS 2014, and the Workshop on Security and Privacy in Computer and Network Systems, SPCNS 2014.
R 1,649.99
Java Closures and Lambda
Java Closures and Lambda introduces you to significant new changes to the Java language coming out of what is termed Project Lambda. These new changes make their debut in Java 8, and their highlight is the long-awaited support for lambda expressions in the Java language. You’ll learn to write lambda expressions and use them to create functional interfaces and default methods for evolving APIs, among many other uses. The changes in Java 8 are significant. Syntax and usage of the language are changed considerably with the introduction of closures and lambda expressions. This book takes you through these important changes from introduction to mastery. Through a set of clear examples, you’ll learn to refactor existing code to take advantage of the new language features. You’ll learn what those features can do for you, and when they are best applied. You’ll learn to design and write new code having these important new features in mind from the very beginning.Clearly explains the fantastic benefits resulting from Project Lambda Explains the syntax and IDE support for the new features Shows how to streamline your code by bringing some of the benefits of functional programming to the Java language Illustrates parallelism in closures through Stream and Spliterator objects Explains API evolution by adding methods to existing interfaces without breaking existing interface implementations, a technique addressing potential multiple inheritance issues
R 1,140.00
Parallel Architectures, Algorithms and Programming
This book constitutes the refereed proceedings of the 11th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2020, held in Shenzhen, China, in December 2020.The 37 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers deal with research results and development activities in all aspects of parallel architectures, algorithms and programming techniques.
R 2,198.71
Hypercube Algorithms
Fundamentals algorithms for SIMD and MIMD hypercubes are developed. These include algorithms for such problems as data broadcasting, data sum, prefix sum, shift, data circulation, data accumulation, sorting, random access reads and writes and data permutation. The fundamental algorithms are then used to obtain efficient hypercube algorithms for matrix multiplication, image processing problems such as convolution, template matching, hough transform, clustering and image processing transformation, and string editing. Most of the algorithms in this book are for hypercubes with the number of processors being a function of problems size. However, for image processing problems, the book also includes algorithms for and MIMD hypercube with a small number of processes. Experimental results on an NCUBE/77 MIMD hypercube are also presented. The book is suitable for use in a one-semester or one-quarter course on hypercube algorithms. For students with no prior exposure to parallel algorithms, it is recommended that one week will be spent on the material in chapter 1, about six weeks on chapter 2 and one week on chapter 3. The remainder of the term can be spent covering topics from the rest of the book.
R 1,635.10
Combinatorial Algorithms
This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.
R 3,993.40
Anomaly Detection Principles and Algorithms
This book provides a readable and elegant presentation of the principles of anomaly detection,providing an easy introduction for newcomers to the field. A large number of algorithms are succinctly described, along with a presentation of their strengths and weaknesses.The authors also cover algorithms that address different kinds of problems of interest with single and multiple time series data and multi-dimensional data. New ensemble anomaly detection algorithms are described, utilizing the benefits provided by diverse algorithms, each of which work well on some kinds of data. With advancements in technology and the extensive use of the internet as a medium for communications and commerce, there has been a tremendous increase in the threats faced by individuals and organizations from attackers and criminal entities. Variations in the observable behaviors of individuals (from others and from their own past behaviors) have been found to be useful in predicting potential problems of various kinds. Hence computer scientists and statisticians have been conducting research on automatically identifying anomalies in large datasets. This book will primarily target practitioners and researchers who are newcomers to the area of modern anomaly detection techniques. Advanced-level students in computer science will also find this book helpful with their studies.
R 4,344.12
Wireless Algorithms, Systems, and Applications
The three-volume set constitutes the proceedings of the 17th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2022, which was held during October 28-30, 2022. The conference took place in Dalian, China.The 95 full and 62 short papers presented in these proceedings were carefully reviewed and selected from 265 submissions. The contributions in algorithms, systems; and applications of internet of things;information processing and data management;radar and sonar networks
R 4,334.80
Introduction To The Analysis Of Algorithms, An
This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants.The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions.This self-contained book is intended for undergraduate students in computer science and mathematics.
R 1,461.93
Parallel Algorithms in Computational Science and Engineering
This contributed volume highlights two areas of fundamental interest in high-performance computing: core algorithms for important kernels and computationally demanding applications. The first few chapters explore algorithms, numerical techniques, and their parallel formulations for a variety of kernels that arise in applications. The rest of the volume focuses on state-of-the-art applications from diverse domains. By structuring the volume around these two areas, it presents a comprehensive view of the application landscape for high-performance computing, while also enabling readers to develop new applications using the kernels. Readers will learn how to choose the most suitable parallel algorithms for any given application, ensuring that theory and practicality are clearly connected. Applications using these techniques are illustrated in detail, including:Computational materials science and engineeringComputational cardiovascular analysisMultiscale analysis of wind turbines and turbomachineryWeather forecastingMachine learning techniquesParallel Algorithms in Computational Science and Engineering will be an ideal reference for applied mathematicians, engineers, computer scientists, and other researchers who utilize high-performance computing in their work.
R 5,004.31
Refactoring in Java
Master code refactoring techniques, improve code quality, design, and maintainability, and boost your development productivity with this comprehensive handbookKey FeaturesGet a thorough understanding of code refinement for enhanced codebase efficiencyWork with real-world examples and case studies for hands-on learning and applicationFocus on essential tools, emphasizing development productivity and robust coding habitsPurchase of the print or Kindle book includes a free PDF eBookBook DescriptionRefactoring in Java serves as an indispensable guide to enhancing your codebase’s quality and maintainability.The book begins by helping you get to grips with refactoring fundamentals, including cultivating good coding habits and identifying red flags. You’ll explore testing methodologies, essential refactoring techniques, and metaprogramming, as well as designing a good architecture. The chapters clearly explain how to refactor and improve your code using real-world examples and proven techniques. Part two equips you with the ability to recognize code smells, prioritize tasks, and employ automated refactoring tools, testing frameworks, and code analysis tools. You’ll discover best practices to ensure efficient code improvement so that you can navigate complexities with ease. In part three, the book focuses on continuous learning, daily practices enhancing coding proficiency, and a holistic view of the architecture. You’ll get practical tips to mitigate risks during refactoring, along with guidance on measuring impact to ensure that you become an efficient software craftsperson.By the end of this book, you’ll be able to avoid unproductive programming or architecturing, detect red flags, and propose changes to improve the maintainability of your codebase.What you will learnRecognize and address common issues in your codeFind out how to determine which improvements are most importantImplement techniques such as using polymorphism instead of conditionsEfficiently leverage tools for streamlining refactoring processesEnhance code reliability through effective testing practicesDevelop the skills needed for clean and readable code presentationGet to grips with the tools you need for thorough code examinationApply best practices for a more efficient coding workflowWho this book is forThis book is for Java developers, software architects, and technical leads looking for a comprehensive guide to advancing their skills in software design and refactoring. The book is ideal for experienced Java enthusiasts, quality assurance engineers, and codebase maintainers as it provides practical insights, real-world examples, and essential patterns. Development managers who want to foster clean coding practices by using best practices for efficient workflows will also find this book useful.
R 1,563.00
Wireless Algorithms, Systems, and Applications
The three-volume set constitutes the proceedings of the 16th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2021, which was held during June 25-27, 2021. The conference took place in Nanjing, China.The 103 full and 57 short papers presented in these proceedings were carefully reviewed and selected from 315 submissions. The contributions in Part II of the set are subdivided into the following topical sections: Scheduling & Optimization II; Security; Data Center Networks and Cloud Computing; Privacy-Aware Computing; Internet of Vehicles; Visual Computing for IoT; Mobile Ad-Hoc Networks.
R 4,330.85
Design and Analysis of Randomized Algorithms
Systematically teaches key paradigmic algorithm design methodsProvides a deep insight into randomization
R 1,689.45
Matrices and Simplex Algorithms
This is a textbook devoted to mathematical programming algorithms and the mathematics needed to understand such algorithms. It was mainly written for economists, but the mathematics itself obviously has relevance for other disciplines. It is a textbook as well a~ in parts, a contribution to new knowledge. There is, accordingly, a broad ordering of climbing sophistication, the earlier chapters being purely for the student, the later chapters being more specialist and containing some element of novelty on certain points. The book is edited in five parts. Part I deals with elementary matrix operations, matrix inversion, determinants, etc. Part II is mainly devoted to linear programming. As far as students' readability is concerned, these two parts are elementary undergraduate material. However, I would claim, in particular with respect to linear programming, that I do things more efficiently than the standard textbook approach has it. This refers mainly to the search for a feasible solution i.e. Chapter 9, and to upper and lower limits, i.e. Chapter 10. I have also argued that the standard textbook treatment of degeneracy misses a relevant problem, namely that of accuracy. In short, I would invite anyone who has the task of writing or designing an LP-code, to first acquaint himself with my ideas. viii INTRODUCTION Parts III and IV are concerned with nonlinear programming.
R 1,637.77
Gems of Combinatorial Optimization and Graph Algorithms
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science? Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks. This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
R 2,564.00
Advances in Metaheuristic Algorithms for Optimal Design of Structures
This book presents efficient metaheuristic algorithms for optimal design of structures. Many of these algorithms are developed by the author and his graduate students, consisting of Particle Swarm Optimization, Charged System Search, Magnetic Charged System Search, Field of Forces Optimization, Democratic Particle Swarm Optimization, Dolphin Echolocation Optimization, Colliding Bodies Optimization, Ray Optimization. These are presented together with algorithms which are developed by other authors and have been successfully applied to various optimization problems. These consist of Partical Swarm Optimization, Big Band Big Crunch algorithm, Cuckoo Search Optimization, Imperialist Competitive Algorithm and Chaos Embedded Metaheuristic Algorithm. Finally a multi-objective Optimization is presented to Solve large scale structural problems based on the Charged System Search algorithm, In the second edition seven new chapters are added consisting of Enhance colliding bodies optimization, Global sensitivity analysis, Tug of War Optimization, Water evaporation optimization, Vibrating System Optimization and Cyclical Parthenogenesis Optimization algorithm. In the third edition, five new chapters are included consisting of the recently developed algorithms. These are Shuffled Shepherd Optimization Algorithm, Set Theoretical Shuffled Shepherd Optimization Algorithm, Set Theoretical Teaching-Learning-Based Optimization Algorithm, Thermal Exchange Metaheuristic Optimization Algorithm, and Water Strider Optimization Algorithm and Its Enhancement. The concepts and algorithm presented in this book are not only applicable to optimization of skeletal structure, finite element models, but can equally be utilized for optimal design of other systems such as hydraulic and electrical networks.
R 10,658.02
Mathematics of Discrete Structures for Computer Science
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
R 1,557.97
Randomized Algorithms: Approximation, Generation, and Counting
Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like "How many are there?" and "What does it look like on average?" of families of combinatorial structures, answers are often difficult to find -- we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain Monte Carlo method, as well as highlighting the method's natural limits. It uses the technique of coupling before introducing "path coupling" a new technique which radically simplifies and improves upon previous methods in the area.
R 3,017.77
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,729.94
Foundations of Software Science and Computation Structures
This book constitutes the proceedings of the 19thInternational Conference on Foundations of Software Science and ComputationStructures, FOSSACS 2016, which took place in Eindhoven, The Netherlands, inApril 2016, held as Part of the European Joint Conferences on Theory andPractice of Software, ETAPS 2016.The 31 full papers presented in this volume werecarefully reviewed and selected from 85 submissions. They were organized intopical sections named: types; recursion and fixed-points; verification andprogram analysis; automata, logic, games; probabilistic and timed systems;proof theory and lambda calculus; algorithms for infinite systems; and monads.
R 2,216.35
Foundations of Data Organization and Algorithms
The Third International Conference on Foundations of Data Organization and Algorithms has been organized by INRIA in Paris from June 21 to 23, 1989. Previous FODO Conferences were held in Warsaw, 1981, and in Kyoto, 1985. The goal of this year's conference is to present advances in techniques of permanent and temporary data organization in different fields. New applications such as image processing, graphics, geographic data processing, robotics, office automation, information systems, language translation, and expert systems have developed various data organizations and algorithms specific to the application requirements. The growing importance of these applications has created a need for general studies on data organization and algorithms as well as for specific studies on new database management systems and on filing services. The articles submitted for the conference were subject to the usual rigorous reviewing process and selected on that basis. They offer an excellent snapshot of the state of the art in the field and should prove invaluable for computer scientists faced by the problems of data organization which are raised by these new applications.
R 1,595.75
Algorithms and Computation
This volume presents the proceedings of the fourth annualInternational Symposium on Algorithms and Computation, heldin Hong Kong in December 1993.Numerous selected paperspresent original research in such areas as design andanalysis of algorithms, computational complexity, and theoryof computation. Topics covered include:- automata, languages, and computability,- combinatorial, graph, geometric, and randomizedalgorithms,- networks and distributed algorithms,- VLSIand parallel algorithms,- theory of learning and robotics,- number theory and robotics.Three invited papers are also included.
R 3,081.39
R 3,381.00
Algorithms for Data and Computation Privacy
This book introduces the state-of-the-art algorithms for data and computation privacy. It mainly focuses on searchable symmetric encryption algorithms and privacy preserving multi-party computation algorithms. This book also introduces algorithms for breaking privacy, and gives intuition on how to design algorithm to counter privacy attacks. Some well-designed differential privacy algorithms are also included in this book.Driven by lower cost, higher reliability, better performance, and faster deployment, data and computing services are increasingly outsourced to clouds. In this computing paradigm, one often has to store privacy sensitive data at parties, that cannot fully trust and perform privacy sensitive computation with parties that again cannot fully trust. For both scenarios, preserving data privacy and computation privacy is extremely important. After the Facebook–Cambridge Analytical data scandal and the implementation of the General Data Protection Regulation by European Union, users are becoming more privacy aware and more concerned with their privacy in this digital world.This book targets database engineers, cloud computing engineers and researchers working in this field. Advanced-level students studying computer science and electrical engineering will also find this book useful as a reference or secondary text.
R 5,861.00
Wireless Algorithms, Systems, and Applications
This book constitutes the refereed proceedings of the Third Annual International Conference on Wireless Algorithms, Systems, and Applications, WASA 2008, held in Dallas, TX, USA, in October 2008. The 35 revised full papers presented together with 3 keynote talks and 15 invited lectures were carefully reviewed and selected from numerous submissions. Providing a forum for researchers and practitioners, from the academic, industrial and governmental sectors, the papers address current research and development efforts of various issues in the area of algorithms, systems and applications for current and next generation infrastructure and infrastructureless wireless networks.
R 1,604.71
R 611.00
Intersection and Decomposition Algorithms for Planar Arrangements
Several geometric problems can be formulated in terms of the arrangement of a collection of curves in a plane, which has made this one of the most widely studied topics in computational geometry. This book, first published in 1991, presents a study of various problems related to arrangements of lines, segments, or curves in the plane. The first problem is a proof of almost tight bounds on the length of (n,s)-Davenport–Schinzel sequences, a technique for obtaining optimal bounds for numerous algorithmic problems. Then the intersection problem is treated. The final problem is improving the efficiency of partitioning algorithms, particularly those used to construct spanning trees with low stabbing numbers, a very versatile tool in solving geometric problems. A number of applications are also discussed. Researchers in computational and combinatorial geometry should find much to interest them in this book.
R 5,640.77
Experimental and Efficient Algorithms
The Third International Workshop on Experimental and E?cient Algorithms (WEA 2004) was held in Angra dos Reis (Brazil), May 25-28, 2004. TheWEAworkshopsaresponsoredbytheEuropeanAssociationforTheo- tical Computer Science (EATCS). They are intended to provide an international forum for researchers in the areas of design, analysis, and experimental eval- tion of algorithms. The two preceding workshops in this series were held in Riga (Latvia, 2001) and Ascona (Switzerland, 2003). This proceedings volume comprises 40 contributed papers selected by the Program Committee along with the extended abstracts of the invited lectures presentedbyRichardKarp(UniversityofCaliforniaatBerkeley,USA),Giuseppe Italiano (University of Rome "Tor Vergata", Italy), and Christos Kaklamanis (University of Patras, Greece). As the organizer and chair of this wokshop, I would like to thank all the authors who generously supported this project by submitting their papers for publication in thisvolume. Iamalso grateful to theinvited lecturers, who kindly accepted our invitation.For their dedication and collaboration in the refereeing procedure, I would like also to express my gratitude to the members of the Program Committee: E. Amaldi (Italy), J. Blazewicz (Poland), V.-D. Cung (France), U. Derigs (G- many), J. Diaz (Spain), M. Gendreau (Canada), A. Goldberg (USA), P. Hansen (Canada), T. Ibaraki (Japan), K. Jansen (Germany), S. Martello (Italy), C.C. McGeoch (USA), L.S. Ochi (Brazil), M.G.C. Resende (USA), J. Rolim (Sw- zerland), S. Skiena (USA), M. Sniedovich (Australia), C.C. Souza (Brazil), P.
R 1,604.71
Gems of Combinatorial Optimization and Graph Algorithms
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science? Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks. This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
R 4,211.12
Stochastic Algorithms: Foundations and Applications
SAGA 2001, the ?rst Symposium on Stochastic Algorithms, Foundations and Applications, took place on December 13–14, 2001 in Berlin, Germany. The present volume comprises contributed papers and four invited talks that were included in the ?nal program of the symposium. Stochastic algorithms constitute a general approach to ?nding approximate solutions to a wide variety of problems. Although there is no formal proof that stochastic algorithms perform better than deterministic ones, there is evidence by empirical observations that stochastic algorithms produce for a broad range of applications near-optimal solutions in a reasonable run-time. The symposium aims to provide a forum for presentation of original research in the design and analysis, experimental evaluation, and real-world application of stochastic algorithms. It focuses, in particular, on new algorithmic ideas invo- ing stochastic decisions and exploiting probabilistic properties of the underlying problem domain. The program of the symposium re?ects the e?ort to promote cooperation among practitioners and theoreticians and among algorithmic and complexity researchers of the ?eld. In this context, we would like to express our special gratitude to DaimlerChrysler AG for supporting SAGA 2001. The contributed papers included in the proceedings present results in the following areas: Network and distributed algorithms; local search methods for combinatorial optimization with application to constraint satisfaction problems, manufacturing systems, motor control unit calibration, and packing ?exible - jects; and computational learning theory.
R 2,127.62
Parallel Algorithms in Computational Science and Engineering
This contributed volume highlights two areas of fundamental interest in high-performance computing: core algorithms for important kernels and computationally demanding applications. The first few chapters explore algorithms, numerical techniques, and their parallel formulations for a variety of kernels that arise in applications. The rest of the volume focuses on state-of-the-art applications from diverse domains. By structuring the volume around these two areas, it presents a comprehensive view of the application landscape for high-performance computing, while also enabling readers to develop new applications using the kernels. Readers will learn how to choose the most suitable parallel algorithms for any given application, ensuring that theory and practicality are clearly connected. Applications using these techniques are illustrated in detail, including:Computational materials science and engineeringComputational cardiovascular analysisMultiscale analysis of wind turbines and turbomachineryWeather forecastingMachine learning techniquesParallel Algorithms in Computational Science and Engineering will be an ideal reference for applied mathematicians, engineers, computer scientists, and other researchers who utilize high-performance computing in their work.
R 4,512.67
R 1,527.00
Algorithms for Parallel Processing
This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on "MATHEMATICS IN HIGH-PERFORMANCE COMPUTING. " The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer Science and Engineering), and Robert S. Schreiber of Hewlett Packard Laboratories for their excellent work in organizing the workshop and editing the proceedings. We also take this opportunity to thank the National Science Founda tion (NSF) and the Army Research Office (ARO), whose financial support made the workshop possible. A vner Friedman Robert Gulliver v PREFACE The Workshop on Algorithms for Parallel Processing was held at the IMA September 16 - 20, 1996; it was the first workshop of the IMA year dedicated to the mathematics of high performance computing. The work shop organizers were Abhiram Ranade of The Indian Institute of Tech nology, Bombay, Michael Heath of the University of Illinois, and Robert Schreiber of Hewlett Packard Laboratories. Our idea was to bring together researchers who do innovative, exciting, parallel algorithms research on a wide range of topics, and by sharing insights, problems, tools, and methods to learn something of value from one another.
R 3,052.32
Mathematics of Discrete Structures for Computer Science
Mathematics plays a key role in computer science, some researchers would consider computers as nothing but the physical embodiment of mathematical systems. And whether you are designing a digital circuit, a computer program or a new programming language, you need mathematics to be able to reason about the design -- its correctness, robustness and dependability. This book covers the foundational mathematics necessary for courses in computer science.The common approach to presenting mathematical concepts and operators is to define them in terms of properties they satisfy, and then based on these definitions develop ways of computing the result of applying the operators and prove them correct. This book is mainly written for computer science students, so here the author takes a different approach: he starts by defining ways of calculating the results of applying the operators and then proves that they satisfy various properties. After justifying his underlying approach the author offers detailed chapters covering propositional logic, predicate calculus, sets, relations, discrete structures, structured types, numbers, and reasoning about programs.The book contains chapter and section summaries, detailed proofs and many end-of-section exercises -- key to the learning process. The book is suitable for undergraduate and graduate students, and although the treatment focuses on areas with frequent applications in computer science, the book is also suitable for students of mathematics and engineering.
R 2,365.27
Algorithms and Discrete Applied Mathematics
This book constitutes the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2022, which was held in Puducherry, India, during February 10-12, 2022. The 24 papers presented in this volume were carefully reviewed and selected from 80 submissions. The papers were organized in topical sections named: graph theory, graph algorithms, computational geometry, algorithms and optimization.
R 3,325.00
Nature-Inspired Computation in Data Mining and Machine Learning
This book reviews the latest developments in nature-inspired computation, with a focus on the cross-disciplinary applications in data mining and machine learning. Data mining, machine learning and nature-inspired computation are current hot research topics due to their importance in both theory and practical applications. Adopting an application-focused approach, each chapter introduces a specific topic, with detailed descriptions of relevant algorithms, extensive literature reviews and implementation details. Covering topics such as nature-inspired algorithms, swarm intelligence, classification, clustering, feature selection, cybersecurity, learning algorithms over cloud, extreme learning machines, object categorization, particle swarm optimization, flower pollination and firefly algorithms, and neural networks, it also presents case studies and applications, including classifications of crisis-related tweets, extraction of named entities in the Tamil language, performance-based prediction of diseases, and healthcare services. This book is both a valuable a reference resource and a practical guide for students, researchers and professionals in computer science, data and management sciences, artificial intelligence and machine learning.
R 4,242.87
Experimental Algorithms
This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016.The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.
R 2,190.48
Design of Approximation Algorithms
Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
R 3,219.17
Link Mining: Models, Algorithms, and Applications
With the recent ?ourishing research activities on Web search and mining, social networkanalysis,informationnetworkanalysis,informationretrieval,linkana- sis,andstructuraldatamining,researchonlinkmininghasbeenrapidlygrowing, forminganew?eldofdatamining. Traditionaldataminingfocuseson"?at"or"isolated"datainwhicheachdata objectisrepresentedasanindependentattributevector. However,manyreal-world data sets are inter-connected, much richer in structure, involving objects of h- erogeneoustypesandcomplexlinks. Hence,thestudyoflinkminingwillhavea highimpactonvariousimportantapplicationssuchasWebandtextmining,social networkanalysis,collaborative?ltering,andbioinformatics. Asanemergingresearch?eld,therearecurrentlynobooksfocusingonthetheory andtechniquesaswellastherelatedapplicationsforlinkmining,especiallyfrom aninterdisciplinarypointofview. Ontheotherhand,duetothehighpopularity oflinkagedata,extensiveapplicationsrangingfromgovernmentalorganizationsto commercial businesses to people's daily life call for exploring the techniques of mininglinkagedata.Therefore,researchersandpractitionersneedacomprehensive booktosystematicallystudy,furtherdevelop,andapplythelinkminingtechniques totheseapplications. Thisbookcontainscontributedchaptersfromavarietyofprominentresearchers inthe?eld. Whilethechaptersarewrittenbydifferentresearchers,thetopicsand contentareorganizedinsuchawayastopresentthemostimportantmodels,al- rithms,andapplicationsonlinkmininginastructuredandconciseway. Giventhe lackofstructurallyorganizedinformationonthetopicoflinkmining,thebookwill provideinsightswhicharenoteasilyaccessibleotherwise. Wehopethatthebook willprovideausefulreferencetonotonlyresearchers,professors,andadvanced levelstudentsincomputersciencebutalsopractitionersinindustry. Wewouldliketoconveyourappreciationtoallauthorsfortheirvaluablec- tributions. WewouldalsoliketoacknowledgethatthisworkissupportedbyNSF throughgrantsIIS-0905215,IIS-0914934,andDBI-0960443. Chicago,Illinois PhilipS. Yu Urbana-Champaign,Illinois JiaweiHan Pittsburgh,Pennsylvania ChristosFaloutsos v Contents Part I Link-Based Clustering 1 Machine Learning Approaches to Link-Based Clustering...3 Zhongfei(Mark)Zhang,BoLong,ZhenGuo,TianbingXu, andPhilipS.Yu 2 Scalable Link-Based Similarity Computation and Clustering...45 XiaoxinYin,JiaweiHan,andPhilipS. Yu 3 Community Evolution and Change Point Detection in Time-Evolving Graphs...73 JimengSun,SpirosPapadimitriou,PhilipS. Yu,andChristosFaloutsos Part II Graph Mining and Community Analysis 4 A Survey of Link Mining Tasks for Analyzing Noisy and Incomplete Networks...107 GalileoMarkNamata,HossamSharara,andLiseGetoor 5 Markov Logic: A Language and Algorithms for Link Mining...135 PedroDomingos,DanielLowd,StanleyKok,AniruddhNath,Hoifung Poon,MatthewRichardson,andParagSingla 6 Understanding Group Structures and Properties in Social Media...163 LeiTangandHuanLiu 7 Time Sensitive Ranking with Application to Publication Search...187 XinLi,BingLiu,andPhilipS. Yu 8 Proximity Tracking on
R 6,049.93
WALCOM: Algorithms and Computation
This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.
R 1,576.36
