Cheong otfried (32 Ergebnisse)

Zustand: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Zustand: good. Gently used with minimal wear on the corners and cover. A few pages may contain light highlighting or writing, but the text remains fully legible. Dust jacket may be missing, and supplemental materials like CDs or codes may not be included. May be ex-library with library markings. Ships promptly. …

Hardcover. Zustand: Very Good. Third Edition 2008. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Zustand: Fine. *Price HAS BEEN REDUCED by 10% until Monday, Nov. 9 (weekend SALE item)* 398 pp., hardcover, fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. …

Hardcover. Zustand: Used; Good.

hardcover. Zustand: Fine.

Zustand: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

Zustand: New.

Hardback. Zustand: New. Third Edition 2008. Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains-computer graphics, geographic information systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry,but it can also be used for self-study.…

Hardback. Zustand: New. Third Edition 2008. Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains-computer graphics, geographic information systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry,but it can also be used for self-study.…

Zustand: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

Zustand: New. pp. xii + 386 370 Illus.

Zustand: As New. Unread book in perfect condition.

Zustand: New. In English.

Zustand: New. pp. xii + 386.

Hardcover. Zustand: Brand New. 3rd edition. 386 pages. French language. 9.50x7.50x1.25 inches. In Stock.

hardcover. Zustand: New. In shrink wrap. Looks like an interesting title.

Paperback. Zustand: Brand New. 1st edition. 483 pages. 9.00x6.00x1.00 inches. In Stock.

Hardcover. Zustand: Brand New. 3rd edition. 386 pages. French language. 9.50x7.50x1.25 inches. In Stock.

Zustand: New. A broad overview of the major algorithms and data structures of the fieldMotivated from applicationsCovers concepts and techniquesto be presented in any course on computational geometrySelf-contained and illustrated with 370 figures.

Zustand: New. Invited Talks.- Regular Labelings and Geometric Structures.- Algorithmic Aspects of Secure Computation and Communication.- Session 1A. Approximation Algorithm I.- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tou.

Hardback. Zustand: New. Third Edition 2008. Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains-computer graphics, geographic information systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry,but it can also be used for self-study.…

Taschenbuch. Zustand: Neu. Neuware - This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010.The 77 revised full papers presented were carefully reviewed and selected from 182 submissions for inclusion in the book. This volume contains topics such as approximation algorithm; complexity; data structure and algorithm; combinatorial optimization; graph algorithm; computational geometry; graph coloring; fixed parameter tractability; optimization; online algorithm; and scheduling.…

Zustand: New. pp. 465.

Hardcover. Zustand: new. Hardcover. Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domainscomputer graphics, geographic information systems (GIS), robotics, and othersin which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry,but it can also be used for self-study. The success of the ?eld as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domainscomputer graphics, geographic information systems (GIS), robotics, and othersin which geometric algorithms play a fundamental role. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Hardback. Zustand: New. Third Edition 2008. Computational geometry emerged from the ?eld of algorithms design and analysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The success of the ?eld as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains-computer graphics, geographic information systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or dif?cult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simpli?ed many of the previous approaches. In this textbook we have tried to make these modern algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry,but it can also be used for self-study.…

Zustand: New. Session 6A. Data Structure and Algorithm II.- D2-Tree: A New Overlay with Deterministic Bounds.- Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets.- Dynamic Range Reporting in External Memory.- A Cac.

Paperback. Zustand: Brand New. 492 pages. 9.29x6.14x1.10 inches. In Stock.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 473 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Taschenbuch. Zustand: Neu. Neuware - This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010.The 77 revised full papers presented were carefully reviewed and selected from 182 submissions for inclusion in the book. This volume contains topics such as approximation algorithm; complexity; data structure and algorithm; combinatorial optimization; graph algorithm; computational geometry; graph coloring; fixed parameter tractability; optimization; online algorithm; and scheduling.…