Search results for "data structures and algorithms in java"
Items we need to order for you
Parallel Algorithms for Irregularly Structured Problems
This book constitutes the refereed proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems, IRREGULAR '96, held in Santa Barbara, California, in August 1996.The volume presents 28 revised full papers selected from 51 submissions; also included are one full invited paper by Torben Hagerup and abstracts of four other invited talks. The papers are organized in topical sections on sparse matrix problems, partitioning and domain composition, irregular applications, communication and synchronization, systems support, and mapping and load balancing.
R 1,568.42
R 670.15
Algorithms in Combinatorial Geometry
Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
R 3,060.38
Machine Learning Algorithms for Signal and Image Processing
Machine Learning Algorithms for Signal and Image Processing Enables readers to understand the fundamental concepts of machine and deep learning techniques with interactive, real-life applications within signal and image processing Machine Learning Algorithms for Signal and Image Processing aids the reader in designing and developing real-world applications using advances in machine learning to aid and enhance speech signal processing, image processing, computer vision, biomedical signal processing, adaptive filtering, and text processing. It includes signal processing techniques applied for pre-processing, feature extraction, source separation, or data decompositions to achieve machine learning tasks. Written by well-qualified authors and contributed to by a team of experts within the field, the work covers a wide range of important topics, such as: Speech recognition, image reconstruction, object classification and detection, and text processing Healthcare monitoring, biomedical systems, and green energy How various machine and deep learning techniques can improve accuracy, precision rate recall rate, and processing time Real applications and examples, including smart sign language recognition, fake news detection in social media, structural damage prediction, and epileptic seizure detection Professionals within the field of signal and image processing seeking to adapt their work further will find immense value in this easy-to-understand yet extremely comprehensive reference work. It is also a worthy resource for students and researchers in related fields who are looking to thoroughly understand the historical and recent developments that have been made in the field.
R 5,210.00
Algorithmic Aspects of Analysis, Prediction, and Control in Science and Engineering
This book demonstrates how to describe and analyze a system's behavior and extract the desired prediction and control algorithms from this analysis. A typical prediction is based on observing similar situations in the past, knowing the outcomes of these past situations, and expecting that the future outcome of the current situation will be similar to these past observed outcomes. In mathematical terms, similarity corresponds to symmetry, and similarity of outcomes to invariance. This book shows how symmetries can be used in all classes of algorithmic problems of sciences and engineering: from analysis to prediction to control. Applications cover chemistry, geosciences, intelligent control, neural networks, quantum physics, and thermal physics. Specifically, it is shown how the approach based on symmetry and similarity can be used in the analysis of real-life systems, in the algorithms of prediction, and in the algorithms of control.
R 3,016.01
Graph Algorithms
Shimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.
R 1,854.96
Design and Analysis of Randomized Algorithms
Systematically teaches key paradigmic algorithm design methodsProvides a deep insight into randomization
R 1,957.95
Algorithms and Discrete Applied Mathematics
This book constitutes the proceedings of the 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020, held in Hyderabad, India, in February 2020. The 38 papers presented together with 2 invited talks in this volume were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on graph algorithms, graph theory, combinatorial optimization, distributed algorithms, combinatorial algorithms, and computational complexity.
R 2,263.81
Algorithmic Aspects in Information and Management
This book constitutes the refereed proceedings of the Third International Conference on Algorithmic Aspects in Information and Management, AAIM 2007, held in Portland, OR, USA in June 2007.It covers graph algorithms, combinatorics, scheduling, graph theory, network algorithms, game theory, option theory, computational geometry, graph theory and combinatorics, as well as networks and data.
R 1,579.58
Elements of Distributed Algorithms
Distributed Computing is rapidly becoming the principal computing paradigm in diverse areas of computing, communication, and control. Processor clusters, local and wide area networks, and the information highway evolved a new kind of problems which can be solved with distributed algorithms.In this textbook a variety of distributed algorithms are presented independently of particular programming languages or hardware, using the graphically suggestive technique of Petri nets which is both easy to comprehend intuitively and formally rigorous. By means of temporal logic the author provides surprisingly simple yet powerful correctness proofs for the algorithms.The scope of the book ranges from distributed control and synchronization of two sites up to algorithms on any kind of networks. Numerous examples show that description and analysis of distributed algorithms in this framework are intuitive and technically transparent.
R 1,649.00
R 1,544.76
Algorithms and Computation
This book constitutes the refereed proceedings of the 8th International Symposium on Algorithms and Computation, ISAAC'97, held in Singapore in December 1997. The 42 revised full papers presented were selected from a total of 98 submissions. The scope of the volume spans the whole area of algorithms from discrete mathematics and complexity theory to algorithms design and evaluation in a variety of applicational areas. Among the topics addressed are scheduling and logistics, networking and routing, combinatorial optimization, graph-computations, algorithmic learning, computational geometry, etc.
R 1,580.61
Data Mining and Knowledge Discovery with Evolutionary Algorithms
This book integrates two areas of computer science, namely data mining and evolutionary algorithms. Both these areas have become increasingly popular in the last few years, and their integration is currently an active research area. In general, data mining consists of extracting knowledge from data. The motivation for applying evolutionary algorithms to data mining is that evolutionary algorithms are robust search methods which perform a global search in the space of candidate solutions. This book emphasizes the importance of discovering comprehensible, interesting knowledge, which is potentially useful for intelligent decision making. The text explains both basic concepts and advanced topics
R 3,034.68
R 2,060.00
Parallel Architectures, Algorithms and Programming
This book constitutes the refereed proceedings of the 10th International Symposium on Parallel Architectures, Algorithms and Programming, PAAP 2019, held in Guangzhou, China, in December 2019.The 39 revised full papers and 8 revised short papers presented were carefully reviewed and selected from 121 submissions. The papers deal with research results and development activities in all aspects of parallel architectures, algorithms and programming techniques.
R 1,600.01
Stochastic Algorithms: Foundations and Applications
This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations with a special focus on investigating the power of randomization in algorithmics.
R 1,536.97
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.96
GIS Algorithms
Geographic information systems (GIS) have become increasingly important in helping us understand complex social, economic, and natural dynamics where spatial components play a key role. The critical algorithms used in GIS, however, are notoriously difficult to both teach and understand, in part due to the lack of a coherent representation. GIS Algorithms attempts to address this problem by combining rigorous formal language with example case studies and student exercises.Using Python code throughout, Xiao breaks the subject down into three fundamental areas:Geometric AlgorithmsSpatial IndexingSpatial Analysis and ModellingWith its comprehensive coverage of the many algorithms involved, GIS Algorithms is a key new textbook in this complex and critical area of geography.
R 3,874.74
Computable Structure Theory
This is the first book which gives a unified theory for countable and uncountable computable structures. The work treats computable linear orderings, graphs, groups and Boolean algebras unified with computable metric and Banach spaces, profinite groups, and the like. Further, it provides the first account of these that exploits effective versions of dualities, such as Stone and Pontryagin dualities. The themes are effective classification and enumeration. Topics and features: - - - - - This unique volume is aimed at graduate students and researchers in computability theory, as well as mathematicians seeking to understand the algorithmic content of structure theory. Being self-contained, it provides ample opportunity for self-study.
R 5,457.83
R 1,527.00
Self-Learning and Adaptive Algorithms for Business Applications
In today’s data-driven world, more sophisticated algorithms for data processing are in high demand, mainly when the data cannot be handled with the help of traditional techniques. Self-learning and adaptive algorithms are now widely used by such leading giants that as Google, Tesla, Microsoft, and Facebook in their projects and applications. In this guide designed for researchers and students of computer science, readers will find a resource for how to apply methods that work on real-life problems to their challenging applications, and a go-to work that makes fuzzy clustering issues and aspects clear. Including research relevant to those studying cybernetics, applied mathematics, statistics, engineering, and bioinformatics who are working in the areas of machine learning, artificial intelligence, complex system modeling and analysis, neural networks, and optimization, this is an ideal read for anyone interested in learning more about the fascinating new developments in machine learning.
R 2,954.94
New Algorithms, Architectures and Applications for Reconfigurable Computing
New Algorithms, Architectures and Applications for Reconfigurable Computing consists of a collection of contributions from the authors of some of the best papers from the Field Programmable Logic conference (FPL’03) and the Design and Test Europe conference (DATE’03). In all, seventy-nine authors, from research teams from all over the world, were invited to present their latest research in the extended format permitted by this special volume. The result is a valuable book that is a unique record of the state of the art in research into field programmable logic and reconfigurable computing.The contributions are organized into twenty-four chapters and are grouped into three main categories: architectures, tools and applications. Within these three broad areas the most strongly represented themes are coarse-grained architectures; dynamically reconfigurable and multi-context architectures; tools for coarse-grained and reconfigurable architectures; networking, security and encryption applications.Field programmable logic and reconfigurable computing are exciting research disciplines that span the traditional boundaries of electronic engineering and computer science. When the skills of both research communities are combined to address the challenges of a single research discipline they serve as a catalyst for innovative research. The work reported in the chapters of this book captures that spirit of that innovation.
R 4,659.12
Frontiers in Algorithmics
This book constitutes the refereed proceedings of the First Annual International Frontiers of Algorithmics Workshop, FAW 2007, held in Lanzhou, China in August 2007. Topics covered in the papers include bioinformatics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and protocols, and algorithms in medical applications.
R 1,566.81
Using and Understanding Java Data Objects
This is a practical guide to the features and uses of JDO, with example programs and learning tools provided.
R 1,026.00
Counting, Sampling and Integrating: Algorithms and Complexity
The subject of these notes is counting and related topics, viewed from a computational perspective. A major theme of the book is the idea of accumulating information about a set of combinatorial structures by performing a random walk on those structures. These notes will be of value not only to teachers of postgraduate courses on these topics, but also to established researchers. For the first time this body of knowledge has been brought together in a single volume.
R 2,202.09
Discrete Problems in Nature Inspired Algorithms
This book includes introduction of several algorithms which are exclusively for graph based problems, namely combinatorial optimization problems, path formation problems, etc. Each chapter includes the introduction of the basic traditional nature inspired algorithm and discussion of the modified version for discrete algorithms including problems pertaining to discussed algorithms.
R 2,987.97
Damage Models and Algorithms for Assessment of Structures under Operating Conditions
Extensive amounts of operational data are generated over time by the health monitoring system of a structure’s management system, yet there are few analysis algorithms which can tell the exact working state of the structure on-line. Good maintenance engineers need to know the exact location and state of the structural components after an earthquake or some attack or accident involving the structure, possibly within a matter of hours, and the client also demands a rapid diagnosis of the structure before making decisions on any necessary remedial work. This book is devoted to the condition assessment of a structure under operational loading, with most of the illustrations related to a bridge deck under a group of moving vehicular loads. More generally, a wide variety of excitation forces can be exerted on a structure, from earthquake excitation, wind loading, vehicular loading or ambient excitation at the supports. Different algorithms may be used to enable real time identification with deterministic results on the state of the structure. This book also covers a group of damage-detection-oriented-models developed by the author, including a new decomposition of the system matrices of the beam element and plate element. Methods for extending the deterministic condition assessment to provide statistical information are also included. The methods and algorithms described can be implemented for the on-line condition assessment of a structure through model updating of the structure during the course of extreme loading such as an earthquake, or when under normal ambient excitation or operation excitation. Different sample structures are described and analysed, supplemented with major references.This leading-edge work will be especially useful for researchers and graduate students, and it is also heavily rooted in advanced engineering practice.Series: Structures and Infrastructures Series Structures and Infrastructures comprises advanced-level books dealing with the maintenance, management, and cost analysis of structures and infrastructures. Topics treated include research, development and application of the most advanced technologies for analyzing, predicting, and optimizing the performance of structures and infrastructures, such as buildings, bridges, dams, underground construction, offshore platforms, pipelines, naval vessels, ocean structures, and nuclear power plants, as well as airplanes, aerospace, and automotive structures. Themes featured are mathematical modeling, computer and experimental methods, practical applications in assessment and evaluation, construction and design for durability, decision making, deterioration modeling and aging, failure analysis, field testing, financial planning, inspection and diagnostics, life-cycle analysis and prediction, loads, maintenance strategies, management systems, nondestructive testing, maintenance and management optimization, specifications and codes, structural safety and reliability, system analysis,
R 2,454.00
Spatially Structured Evolutionary Algorithms
Evolutionary algorithms (EAs) is now a mature problem-solving family of heuristics that has found its way into many important real-life problems and into leading-edge scientific research. Spatially structured EAs have different properties than standard, mixing EAs. By virtue of the structured disposition of the population members they bring about new dynamical features that can be harnessed to solve difficult problems faster and more efficiently. This book describes the state of the art in spatially structured EAs by using graph concepts as a unifying theme. The models, their analysis, and their empirical behavior are presented in detail. Moreover, there is new material on non-standard networked population structures such as small-world networks.The book should be of interest to advanced undergraduate and graduate students working in evolutionary computation, machine learning, and optimization. It should also be useful to researchers and professionals working in fields where the topological structures of populations and their evolution plays a role.
R 2,214.13
From Algorithms to Hardware Architectures
This book uses digital radios as a challenging design example, generalized to bridge a typical gap between designers who work on algorithms and those who work to implement those algorithms on silicon. The author shows how such a complex system can be moved from high-level characterization to a form that is ready for hardware implementation. Along the way, readers learn a lot about how algorithm designers can benefit from knowing the hardware they target and how hardware designers can benefit from a familiarity with the algorithm. The book shows how a high-level description of an algorithm can be migrated to a fixed-point block diagram with a well-defined cycle accurate architecture and a fully documented controller. This can significantly reduce the length of the hardware design cycle and can improve its outcomes. Ultimately, the book presents an explicit design flow that bridges the gap between algorithm design and hardware design.Provides a guide to baseband radio design for Wi-Fi and cellular systems, from an implementation-focused, perspective;Explains how arithmetic is moved to hardware and what the cost of each operation is in terms of delay, area and power;Enables strategic architectural decisions based on the algorithm, available processing units and design requirements.
R 4,288.87
Theory of Algorithms
Approach your problems from the right end It isn't that they can't see the solution. It is and begin with the answers. Then one day, that they can't see the problem. perhaps you will tind the tinal question. G. K. Chesterton. The Scandal of Father Brown 'The point of a Pin'. 'The Hermit CIad in Crane Feathers' in R. van Gulik's The Chinese Maze Murders. Growing specialization and diversification have brought a host of monographs and textbooks on increasingly specialized topics. However, the "tree" of knowledge of mathematics and related fields does not grow only by putting forth new branches. It also happens, quite of ten in fact, that branches which were thought to be completely disparate are suddenly seen to be related. Further, the kind and level of sophistication of mathematics applied in various sciences has changed drastically in recent years: measure theory is used (non-trivially) in regional and theoretical economics; algebraic geometry interacts with physics; the Minkowsky lemma, coding theory and the structure of water meet one another in packing and covering theory; quantum fields, crystal defects and mathematical programming profit from homotopy theory; Lie algebras are relevant to fiItering; and prediction and electrical engineering can use Stein spaces. And in addition to this there are such new emerging subdisciplines as "experimental mathematics", "CFD", "completely integrable systems", "chaos, synergetics and large-scale order", which are almost impossible to fit into the existing classification schemes. They draw upon widely different sections of mathematics.
R 4,400.34
R 7,710.66
R 525.00
Computational Complexity and Local Algorithms
This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms.The works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces.
R 3,154.45
Algorithms
Algorithms: Technology, Culture, Politics develops a relational, situated approach to algorithms. It takes a middle ground between theories that give the algorithm a singular and stable meaning in using it as a central analytic category for contemporary society and theories that dissolve the term into the details of empirical studies.The book discusses algorithms in relation to hardware and material conditions, code, data, and subjects such as users, programmers, but also “data doubles”. The individual chapters bridge critical discussions on bias, exclusion, or responsibility with the necessary detail on the contemporary state of information technology. The examples include state of the art applications of machine learning, such as self-driving cars and large language models such as GPT.The book will be of interest for everyone engaging critically with algorithms, particularly in the social sciences, media studies, STS, political theory, or philosophy. With its broad scope it can serve as a high-level introduction that picks up and builds on more than two decades of critical research on algorithms.
R 9,302.33
Knowledge Acquisition: Approaches, Algorithms and Applications
This book constitutes the thoroughly refereed post-workshop proceedings of the 2008 Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, held in Hanoi, Vietnam, in December 2008 as part of 10th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2008. The 20 revised papers presented were carefully reviewed and selected from 57 submissions and went through two rounds of reviewing and improvement. The papers are organized in topical sections on machine learning and data mining, incremental knowledge acquisition, web-based techniques and applications, as well as domain specific knowledge acquisition methods and applications.
R 1,549.02
Algorithms and Architectures for Parallel Processing
This book constitutes the refereed proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2009, held in Taipei, Taiwan, in June 2009.The 80 revised full papers were carefully reviewed and selected from 243 submissions. The papers are organized in topical sections on bioinformatics in parallel computing; cluster, grid and fault-tolerant computing; cluster distributed parallel operating systems; dependability issues in computer networks and communications; dependability issues in distributed and parallel systems; distributed scheduling and load balancing, industrial applications; information security internet; multi-core programming software tools; multimedia in parallel computing; parallel distributed databases; parallel algorithms; parallel architectures; parallel IO systems and storage systems; performance of parallel ditributed computing systems; scientific applications; self-healing, self-protecting and fault-tolerant systems; tools and environments for parallel and distributed software development; and Web service.
R 3,134.90
Introduction to Python Programming and Data Structures, Global Edition
For introductory courses in Python Programming and Data Structures. A fundamentals first approach to programming helps students create efficient, elegant code. Introduction to Python Programming and Data Structures introduces students to basic programming concepts using a fundamentals-first approach that prepares students to learn object-oriented programming and advanced Python programming. This approach presents programming concepts and techniques that include control statements, loops, functions, and arrays before designing custom classes. Students learn basic logic and programming concepts prior to moving into object-oriented and GUI programming. The content incorporates a wide variety of problems with various levels of difficulty and covers many application areas to engage and motivate students.
R 3,391.00
Introduction to the Design and Analysis of Algorithms
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
R 6,473.00
WALCOM: Algorithms and Computation
This book constitutes the proceedings of the 16th International Conference on Algorithms and Computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022.This proceedings volume contains 30 full papers which were carefully reviewed and selected from a total of 89 submissions and 3 invited papers. They cover diverse areas of algorithms and computation, such as approximation algorithms, computational complexity, computational geometry, graph algorithms, graph drawing and visualization, online algorithms, parameterized complexity and property testing.
R 3,341.90
Algorithms and Computation
This book constitutes the refereed proceedings of the 7th International Symposium on Algorithms and Computation, ISAAC'96, held in Osaka, Japan, in December 1996.The 43 revised full papers were selected from a total of 119 submissions; also included are an abstract of one invited talk and a full version of a second. Among the topics covered are computational geometry, graph theory, graph algorithms, combinatorial optimization, searching and sorting, networking, scheduling, and coding and cryptology.
R 1,583.55
Algorithms and Computations
This book presents the refereed proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC '95, held in Cairns, Australia, in December 1995.The 45 revised full papers presented together with the abstracts of three invited talks were selected from a total of 130 submissions. The papers address many current aspects of research and advanced applications of algorithms and computations; among the topics covered are graph theory and graph algorithms, computational geometry, computational logics, searching and sorting, approximation and optimization, algebraic manipulation, and coding.
R 1,582.83
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 November 24th-26th, 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 cyber-physical systems including intelligent transportation systems and smart healthcare systems; security and privacy; topology control and coverage; energy-efficient algorithms, systems and protocol design
R 4,336.43
Algorithms and Computation
This volume contains the proceedings of the Twelfth Annual International S- posiumonAlgorithmsandComputation(ISAAC2001),heldinChristchurch, NewZealand,19-21December2001. Inthepast,ithasbeenheldinTokyo(1990), Taipei(1991),Nagoya(1992),HongKong(1994),Cairnes(1995),Osaka(1996), Singapore(1997),Taejon,Korea(1998),Madras(1999),andTaipei(2000). Since thethirdinNagoya,theproceedingshavebeenpublishedinSpringer-Verlag's Lecture Notes in Computer Science series. AlthoughthesymposiumrotatesmainlyintheAsia/Paci?cregion,ther- ereeingprocesswasconductedinternationally,andresearchersgatheredfrom allovertheworld. Wereceived124submissionsfrom32countries,ofwhich 62 papers were accepted for presentation at the symposium. The papers of three invited speakers are also included. Submission was conducted electro- cally by CyberChair generously o?ered by the University of Twente. Each paper was reviewed by three or four referees with the assistance of external referees, whose names are listed overleaf. Discussions on how to select papers were also conducted electronically over more than a week. Due to the large number of submittedpapers,thereviewingprocesswasquitechallengingfortheprogram committee.There were many acceptable papers which we could not accom- date into the time frame of the three-day symposium. The best paper award was given to "Computing the Quartet Distance between Evolutionary Trees in Time 2 O(nlog n)"byGerthStoltingBrodal,RolfFagerberg,andChristianNorgaard Storm Pedersen. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. IntheeraoftheInternet,wetendtothinkwecanexchangeideaswith other researchers instantly without needing to meet. This way we tend to be isolatedunknowingly. BecauseoftheInternet,however,theneedformeeting otherpeoplefacetofaceiseverincreasing. Todoresearch,itisstillbestto seeourpeersdirectly,andgetideasfromtheveryinventers. WehopeISAAC 2001 made a good forum for researchers in algorithms and computation to meet, beingheldinNewZealand,abeautifulsmallnationof3. 8millionpeople. Itis roughlyatthecenterofthewaterhemisphere,meaningthatitisfarthestfrom therestoftheworld. Peoplecanescapefromtheirdailybusinesses,meetpeople, and refresh their thinking. We thank all the authors who submitted papers and contributed to the high quality of the symposium.We thank all the organizing committee members, programcommitteemembers,andexternalrefereeswhosacri?cedtheirtime for the symposium. We thank all the sponsors who made the symposium ?n- ciallyviable.
R 3,119.46
Experimental Algorithms
This proceedings volume contains the invited papers and the contributed papers th accepted for presentation at the 9 International Symposium on Experimental Algorithms (SEA 2010), that was held at the Continental Terme Hotel, Ischia (Naples), Italy, during May 20-22, 2010. PrevioussymposiaoftheserieswereheldinRiga(2001),MonteVerita(2003), RiodeJaneiro(2004),Santorini(2005),Menorca(2006),Rome(2007),CapeCod (2008), and Dortmund (2009). Seventy-three papers were submitted by researchers from 19 countries. Each paper was reviewed by three experts among the Program Committee members and some trusted external referees. At least two reviewers were from the same or closely related discipline as the authors. The reviewers generally provided a high-quality assessment of the papers and often gave extensive comments to the authors for the possible improvement of the presentation. The submission and review process was supported by the ConfTool conference management software and we are thankful to Harald Weinreich for letting us use it. The Program Committee selected 40 regular papers for presentation at the conference.In addition to the 40 contributed papers, this volume includes two invitedpapersrelatedtocorrespondingkeynotetalks:GiuseppeF.Italiano(U- versity of Rome "Tor Vergata,"Italy)spoke on "ExperimentalStudy of Resilient Algorithms and Data Structures" and PanosM. Pardalos(University of Florida, USA) spoke on "Computational Challenges with Cliques, Quasi-Cliques and Clique Partitions in Graphs." Many people and organizations contributed to SEA 2010. We are parti- larlygrateful for the patronageand ?nancial support of the University of Naples "FedericoII"andtheDepartmentofMathematicsandApplications"R.Cacci- poli,"and for the ?nancial support of GNCS (Gruppo Nazionale per il Calcolo Scienti?co) - INdAM (Istituto Nazionale di Alta Matematica).
R 4,126.04
Algorithms and Computation
This volume contains the proceedings of the 15th Annual International Sym- sium on Algorithms and Computation (ISAAC 2004), held in Hong Kong, 20–22 December, 2004. In the past, it has been held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), and Kyoto (2003). ISAAC is an annual international symposium that covers a wide range of topics,namelyalgorithmsandcomputation.Themainpurposeofthesymposium is to provide a forum for researchers working in the active research community of algorithms and the theory of computation to present and exchange new ideas. In response to our call for papers we received 226 submissions. The task of selectingthepapersinthisvolumewasdonebyourprogramcommitteeandother referees. After a thorough review process the committee selected 76 papers, the decisions being based on originality and relevance to the ?eld of algorithms and computation. We hope all accepted papers will eventually appear in scienti?c journals in a more polished form. Two special issues, one of Algorithmica and one of the International Journal of Computational Geometry and Applications, with selected papers from ISAAC 2004 are in preparation. Thebeststudentpaperawardwillbegivenfor“Geometricoptimizationpr- lems over sliding windows” by Bashir S. Sadjad and Timothy M. Chan from the University of Waterloo. Two eminent invited speakers, Prof. Erik D. Demaine, MIT, and Prof. David M. Mount, University of Maryland, also contributed to this volume.
R 4,030.00
