The book is an introductory textbook mainly for students of computer science and mathematics. Our guiding phrase is "what every theoretical computer scientist should know about linear programming". A major focus is on applications of linear programming, both in practice and in theory. The book is concise, but at the same time, the main results are covered with complete proofs and in sufficient detail, ready for presentation in class. The book does not require more prerequisites than basic linear algebra, which is summarized in an appendix. One of its main goals is to help the reader to see linear programming "behind the scenes".
The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.
Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.
To the uninitiated, algebraic topology might seem fiendishly complex, but its utility is beyond doubt. This brilliant exposition goes back to basics to explain how the subject has been used to further our understanding in some key areas. A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not so widely understood. This book is the first textbook treatment of a significant part of these results. It focuses on so-called equivariant methods, based on the Borsuk-Ulam theorem and its generalizations. The topological tools are intentionally kept on a very elementary level. No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained.
Originally published in 1980, Urbanization in Socialist Countries addresses the complex situation in urban policy development in European Socialist countries. The book examines the urban policy situation in eight countries and provides an analytical framework that addresses the fundamental issues they have faced. The book focuses on the system of settlement and on such problems as its regulation, as well as analysis of the goals, instruments and techniques used in planning the urbanization process in different socialist countries. The book aims to throw light on the basic premises underlying the formulation of urbanization concepts and reveal their main features and lines of development.
This book presents a modern and attractive approach to computer integrated manufacturing (CIM) by stressing the crucial role of information management aspects. The 31 contributions contained constitute the final report on the EC Project TEMPUS No. 2609 aimed at establishing a new curriculum and regular education in the new field of information management in CIM at European universities. Much attention was paid to the style of writing and coverage of the important issues. Thus the book is particularly suited as a text for students and young scientists approaching CIM from different directions; at the same time, it is a comprehensive guide for industrial engineers in machine engineering, computer science, control engineering, artificial intelligence, production management, etc.
The four-volume set comprising LNCS volumes 3021/3022/3023/3024 constitutes the refereed proceedings of the 8th European Conference on Computer Vision, ECCV 2004, held in Prague, Czech Republic, in May 2004. The 190 revised papers presented were carefully reviewed and selected from a total of 555 papers submitted. The four books span the entire range of current issues in computer vision. The papers are organized in topical sections on tracking; feature-based object detection and recognition; geometry; texture; learning and recognition; information-based image processing; scale space, flow, and restoration; 2D shape detection and recognition; and 3D shape representation and reconstruction.
An history that presents a canvas of post-war Czech literary developments within the cultural and political context of the times. It provides information about the many English-language translations from Czech literature, and the circumstances in which these translations came about.
This volume constitutes the proceedings of the 4th International Conference on Database and Expert Systems Applications (DEXA), held in Prague, Czech Republic, in September 1993. Traditionally the objective of the DEXA conferences is to serve as an international forum for the discussion and exchange of research results and practical experinece among theoreticians and professionals working in the field of database and artificial intelligence technologies. Despite the fact that in the conference title the applications aspect is mentioned explicitly, the theoretical and the practical points of view in the field are well-balanced in the program of DEXA'93. The growing importance of the conference series is outlined by the remarkably high number of 269 submissions and by the support given by renown organizations. DEXA'93 is held for the first time outside the former GDR in an East-European country, and is essentially contributing to the advancement of the East-West scientific cooperation in the field of database and AI systems. This proceedings contains the 78 contributed papers carefully selected by an international program committee with thesupport of a high number of subreferees. The volume is organized in sectionson data models, distributed databases, advanced database aspects, database optimization and performance evaluation, spatial and geographic databases, expert systems and knowledge engineering, legal systems, other database and artificial intelligence applications, software engineering, and hypertext/hypermedia and user interfaces.
The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.
What is the "most uniform" way of distributing n points in the unit square? How big is the "irregularity" necessarily present in any such distribution? This book is an accessible and lively introduction to the area of geometric discrepancy theory, with numerous exercises and illustrations. In separate, more specialized parts, it also provides a comprehensive guide to recent research.
The book is an introductory textbook mainly for students of computer science and mathematics. Our guiding phrase is "what every theoretical computer scientist should know about linear programming". A major focus is on applications of linear programming, both in practice and in theory. The book is concise, but at the same time, the main results are covered with complete proofs and in sufficient detail, ready for presentation in class. The book does not require more prerequisites than basic linear algebra, which is summarized in an appendix. One of its main goals is to help the reader to see linear programming "behind the scenes".
To the uninitiated, algebraic topology might seem fiendishly complex, but its utility is beyond doubt. This brilliant exposition goes back to basics to explain how the subject has been used to further our understanding in some key areas. A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not so widely understood. This book is the first textbook treatment of a significant part of these results. It focuses on so-called equivariant methods, based on the Borsuk-Ulam theorem and its generalizations. The topological tools are intentionally kept on a very elementary level. No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained.
Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.
This will help us customize your experience to showcase the most relevant content to your age group
Please select from below
Login
Not registered?
Sign up
Already registered?
Success – Your message will goes here
We'd love to hear from you!
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.