Page 3
Page 3
Computational Geometry and Graph Theory ; International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers
This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007.
Computational Geometry : Algorithms and Applications
This introduction to computational geometry focuses on algorithms. Modern insights in computational geometry are used to provide solutions that are both efficient and easy to understand and implement.
Combinatorial optimization and applications ; 14th International Conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020, Proceedings
This volume constitutes the proceedings of the 14th International Conference on Combinatorial Optimization and Applications, COCOA 2020, held in Dallas, TX, USA, in December 2020. The 55 full papers presented in this volume were carefully reviewed and selected from 104 submissions. The papers are grouped into the following topics: Approximation Algorithms; Scheduling; Network Optimization; Complexity and Logic; Search, Facility and Graphs; Geometric Problem; Sensors, Vehicles and Graphs; and Graph Problems.
Combinatorial Image Analysis ; Vol.4040 : 11th International Workshop, IWCIA 2006, Berlin, Germany, June 19-21, 2006, Proceedings
Constitutes the refereed proceedings of the 11th International Workshop on Combinatorial Image Analysis, IWCIA 2006, held in Berlin, June 2006. The book presents 34 revised full papers together with two invited papers, covering topics including combinatorial image analysis; grammars and models for analysis and recognition of scenes and images; combinatorial topology and geometry for images; digital geometry of curves and surfaces; algebraic approaches to image processing, and more.
Combinatorial Image Analysis ; 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008. Proceedings
This volume contains the proceedings of the 12th International Workshop on Combinatorial Image Analysis. Coverage includes digital geometry, curves and surfaces, applications of computational geometry, as well as medical imaging and biometrics.
Combinatorial image analysis ; 10th International Workshop, IWCIA 2004, Auckland, New Zealand, December 1-3, 2004, Proceedings
This volume presents the proceedings of the 10th International Workshop on Combinatorial Image Analysis,held 2004, in Auckland, New Zealand. For this workshop we received 86 submitted papers from 23 countries. We selected 55 papers for the conference. completed the program. Conference papers are presented in this volume under the following topical part titles: discrete tomography (3 papers), combinatorics and computational models (6), combinatorial algorithms (6), combinatorial mathematics (4), d- ital topology (7), digital geometry (7), approximation of digital sets by curves and surfaces (5), algebraic approaches (5), fuzzy image analysis (2), image s- mentation (6), and matching and recognition (7). These subjects are dealt with in the context of digital image analysis or computer vision.
Combinatorial geometry and graph theory ; Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers
This volume consists of the refereed papers presented at the Indonesia-JapanJoint Conference on Combinatorial Geometry and Graph Theory (IJCCGGT2003), held on Indonesia. This confer-ence can also be considered as a series of the Japan Conference on Discrete andComputational Geometry (JCDCG), 2002.
Mathematical Foundations of Computer Science 2007 ; 32nd International Symposium, MFCS 2007 Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings
This book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Cesk?? Krumlov, Czech Republic, August 26-31, 2007. All current aspects in theoretical computer science and its mathematical foundations are addressed.
Mathematical foundations of computer science 2006 ; 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings
This book constitutes the refereed proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006, held in Stará Lesná, Slovakia in August/September 2006. The 62 revised full papers presented together with the full papers or abstracts of 7 invited talks were carefully reviewed and selected from 174 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithms and data structures, to complexity, automata, semantics, logic, formal specifications, models of computation, concurrency theory, computational geometry, parallel and distributed computing, networks, bioinformatics, quantum computing, cryptography, knowledge-based systems, and artificial intelligence.
Location Theory : A Unified Approach
Although modern location theory is now more than 90 years old, the focus of researchers in this area has been mainly problem oriented. However, a common theory, which keeps the essential characteristics of classical location models, is still missing. This monograph addresses this issue. A flexible location problem called the Ordered Median Problem (OMP) is introduced. For all three main subareas of location theory (continuous, network and discrete location) structural properties of the OMP are presented and solution approaches provided. Numerous illustrations and examples help the reader to become familiar with this new location model.
LATIN 2006 : Theoretical Informatics ; 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings
This book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.
Competitive Programming in Python : 128 Algorithms to Develop your Coding Skills
Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. What to expect: * Master 128 algorithms in Python. * Discover the right way to tackle a problem and quickly implement a solution of low complexity.
Automated deduction in Geometry ; 6th International Workshop, ADG 2006, Pontevedra, Spain, August 31-September 2, 2006, Revised Papers
The book show the lively variety of topics and methods and the current applicability of automated deduction in geometry to different branches of mathematics and to other sciences and technologies.
Automated deduction in Geometry ; 5th International Workshop, ADG 2004, Gainesville, FL, USA, September 16-18, 2004, Revised Papers
This book constitutes the thoroughly refereed post-proceedings of the 6th International Workshop on Automated Deduction in Geometry, ADG 2006, held at Pontevedra, Spain, in August/September 2006 as a satellite event of the International Congress of Mathematicians, ICM 2006. The 13 revised full papers presented were carefully selected from the submissions made due to a call for papers - within the scope of ADG - shortly after the meeting. The papers show the lively variety of topics and methods and the current applicability of automated deduction in geometry to different branches of mathematics and to other sciences and technologies.
Approximation, randomization and combinatorial optimization. algorithms and techniques ; 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings
This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008.
Algorithms for Sensor and Ad Hoc Networks : Advanced Lectures
Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors, are deployed in some terrain or other. After activation the sensors form a self-organized network and provide data, for example about a forthcoming earthquake. The trend towards wireless communication increasingly affects electronic devices in almost every sphere of life. Conventional wireless networks rely on infrastructure such as base stations; mobile devices interact with these base stations in a client/server fashion. In contrast, current research is focusing on networks that are completely unstructured, but are nevertheless able to communicate (via several hops) with each other, despite the low coverage of their antennas. Such systems are called sensor or ad hoc networks, depending on the point of view and the application. Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers in many fields: from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry.
Algorithms and data structures ; 9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
The papers in this volume were presented at the 9th Workshop on Algorithmsand Data Structures (WADS 2005). at the University of Waterloo, Waterloo, Canada. The workshopalternates with the Scandinavian Workshop on Algorithm Theory (SWAT), con-tinuing the tradition of SWAT and WADS starting with SWAT 1988 and WADS1989. From 90 submissions, the Program Committee selected 37 papers for pre-sentation at the workshop. includ Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Computer Graphics Numeric Computing
Algorithms and data structures ; 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings
The book present research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, parallel and distributed computing.
Algorithms and computation ; Vol. 4288: 17th International symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings
This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India in December 2006. The 73 revised full papers presented were carefully reviewed and selected from 255 submissions. The papers are organized in topical sections on algorithms and data structures, online algorithms, approximation algorithm, graphs, computational geometry, computational complexity, network, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography.
Algorithms and computation ; Vol. 3827 ; 16th International symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings
This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005, held in China in 2005. The 112 revised full papers presented were carefully reviewed and selected from 549 submissions. The papers are organized in topical sections on computational geometry, computational optimization, graph drawing and graph algorithms, computational complexity, approximation algorithms, internet algorithms, quantum computing and cryptography, data structure, computational biology, experimental algorithm mehodologies and online algorithms, randomized algorithms, parallel and distributed algorithms, graph drawing and graph algorithms, computational complexity, combinatorial optimization, computational biology, computational complexity, computational optimization, computational geometry, approximation algorithms, graph drawing and graph algorithms, computational geometry, approximation algorithms, graph drawing and graph algorithms, and data structure.
