2003, ISBN: 9783540206958
This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, i… Mehr…
BarnesandNoble.com new in stock. Versandkosten:zzgl. Versandkosten. Details... |
2003, ISBN: 9783540206958
This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15-17 December 2003. In the past, it was … Mehr…
Indigo.ca new in stock. Versandkosten:zzgl. Versandkosten. Details... |
2003, ISBN: 9783540206958
This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, it was … Mehr…
Springer.com Nr. 978-3-540-20695-8. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details... |
Algorithms and Computation 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings - neues Buch
2003, ISBN: 3540206957
2003 Kartoniert / Broschiert Algorithmus, Berechenbarkeit, Diskrete Mathematik, Netzwerk-Hardware, Computerprogrammierung und Softwareentwicklung, Algorithmen und Datenstrukturen, Grafi… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
Algorithms and Computation 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings - neues Buch
2003, ISBN: 3540206957
2003 Kartoniert / Broschiert Algorithmus, Berechenbarkeit, Diskrete Mathematik, Netzwerk-Hardware, Computerprogrammierung und Softwareentwicklung, Algorithmen und Datenstrukturen, Grafi… Mehr…
Achtung-Buecher.de MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien Versandkosten:Versandkostenfrei innerhalb der BRD. (EUR 0.00) Details... |
Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings Toshihide Ibaraki Editor - neues Buch
2003, ISBN: 9783540206958
This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, i… Mehr…
2003, ISBN: 9783540206958
This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15-17 December 2003. In the past, it was … Mehr…
2003
ISBN: 9783540206958
This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, it was … Mehr…
Algorithms and Computation 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings - neues Buch
2003, ISBN: 3540206957
2003 Kartoniert / Broschiert Algorithmus, Berechenbarkeit, Diskrete Mathematik, Netzwerk-Hardware, Computerprogrammierung und Softwareentwicklung, Algorithmen und Datenstrukturen, Grafi… Mehr…
Algorithms and Computation 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings - neues Buch
2003, ISBN: 3540206957
2003 Kartoniert / Broschiert Algorithmus, Berechenbarkeit, Diskrete Mathematik, Netzwerk-Hardware, Computerprogrammierung und Softwareentwicklung, Algorithmen und Datenstrukturen, Grafi… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Algorithms and Computation: 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings Toshihide Ibaraki Editor
EAN (ISBN-13): 9783540206958
ISBN (ISBN-10): 3540206957
Taschenbuch
Erscheinungsjahr: 2003
Herausgeber: Springer Berlin Heidelberg Core >1 >T
772 Seiten
Gewicht: 1,145 kg
Sprache: eng/Englisch
Buch in der Datenbank seit 2007-04-04T20:05:59+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-13T14:05:59+01:00 (Zurich)
ISBN/EAN: 9783540206958
ISBN - alternative Schreibweisen:
3-540-20695-7, 978-3-540-20695-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: katoh, ibar, ansgar klein, rolf klein
Titel des Buches: kyoto, japan computer, algorithms computation, isaac science, lecture notes computer science, symposium notes
Daten vom Verlag:
Autor/in: Toshihide Ibaraki; Naoki Katoh; Hirotaka Ono
Titel: Lecture Notes in Computer Science; Algorithms and Computation - 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings
Verlag: Springer; Springer Berlin
748 Seiten
Erscheinungsjahr: 2003-12-03
Berlin; Heidelberg; DE
Sprache: Englisch
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XVII, 748 p.
BC; Hardcover, Softcover / Informatik, EDV/Informatik; Computerprogrammierung und Softwareentwicklung; Verstehen; Informatik; AAC; algorithms; combinatorial optimization; complexity; computational geometry; data structures; game theory; optimization; scheduling; algorithm analysis and problem complexity; Programming Techniques; Algorithms; Computer Communication Networks; Theory of Computation; Discrete Mathematics in Computer Science; Computer Graphics; Algorithmen und Datenstrukturen; Netzwerk-Hardware; Theoretische Informatik; Mathematik für Informatiker; Diskrete Mathematik; Grafikprogrammierung; EA
Invited Talk.- Interactive Proofs for Quantum Computation.- Drawing Plane Graphs.- 1A Computational Geometry I.- Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve.- A Dynamic Dictionary for Priced Information with Application.- Voronoi Diagram in the Flow Field.- Polygonal Path Approximation: A Query Based Approach.- 1B Graph and Combinatorial Algorithms I.- A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs.- Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees.- Hotlink Enhancement Algorithms for Web Directories.- Finding a Length-Constrained Maximum-Density Path in a Tree.- 2A Computational Complexity I.- The Intractability of Computing the Hamming Distance.- Infinitely-Often Autoreducible Sets.- Limiting Negations in Bounded-Depth Circuits: An Extension of Markov’s Theorem.- Computational Complexity Measures of Multipartite Quantum Entanglement.- 2B Graph and Combinatorial Algorithms II.- A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs.- Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem.- Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems.- A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem.- 3A Quantum Computation.- The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems.- Non-interactive Quantum Perfect and Statistical Zero-Knowledge.- Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur?.- A Faster Lattice Reduction Method Using Quantum Search.- 3B Graph and Combinatorial Algorithms III.- Three Sorting Algorithms Using PriorityQueues.- Lower Bounds on Correction Networks.- Approximate Regular Expression Searching with Arbitrary Integer Weights.- Constructing Compressed Suffix Arrays with Large Alphabets.- 4A Computational Geometry II.- On the Geometric Dilation of Finite Point Sets.- On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts.- Optimal Point Set Projections onto Regular Grids.- 4B Combinatorial Optimization I.- An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas.- A Faster Algorithm for Two-Variable Integer Programming.- Efficient Algorithms for Generation of Combinatorial Covering Suites.- 5A Scheduling.- A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags.- On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates.- Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes.- 5B Computational Biology.- Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome.- Settling the Intractability of Multiple Alignment.- Efficient Algorithms for Optimizing Whole Genome Alignment with Noise.- 6A Computational Geometry III.- Segmenting Doughnut-Shaped Objects in Medical Images.- On the Locality Properties of Space-Filling Curves.- Geometric Restrictions on Producible Polygonal Protein Chains.- Symmetric Layout of Disconnected Graphs.- 6B Graph and Combinatorial Algorithms IV.- Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching.- Enumerating Global Roundings of an Outerplanar Graph.- Augmenting Forests to Meet Odd Diameter Requirements.- On the Existence and Determination of Satisfactory Partitions in a Graph.- 7A Distributed and Parallel Algorithms.- A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model.- An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees.- 7B Graph and Combinatorial Algorithms V.- The Student-Project Allocation Problem.- Algorithms for Enumerating Circuits in Matroids.- A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model.- 8A Data Structure.- Succinct Data Structures for Searchable Partial Sums.- Range Mode and Range Median Queries on Lists and Trees.- Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests.- New Ways to Construct Binary Search Trees.- 8B Graph and Combinatorial Algorithms VI.- Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth.- Biconnectivity on Symbolically Represented Graphs: A Linear Solution.- A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs.- Deterministic Algorithm for the t-Threshold Set Problem.- 9A Combinatorial and Network Optimization.- Energy-Efficient Wireless Network Design.- Wavelength Conversion in Shortest-Path All-Optical Networks.- A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact.- Flexible Train Rostering.- 9B Computational Complexity and Cryptography.- Counting Complexity Classes over the Reals I: The Additive Case.- Some Properties of One-Pebble Turing Machines with Sublogarithmic Space.- Hypergraph Decomposition and Secret Sharing.- A Promising Key Agreement Protocol.- 10A Game Theory and Randomized Algorithm.- Rapid Mixing of Several Markov Chains for a Hard-Core Model.- Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution.- Fair Cost Allocations under Conflicts — A Game-Theoretic Point ofView —.- Equilibria for Networks with Malicious Users.- 10B Algebraic and Arithmetic Computation.- Quasi-optimal Arithmetic for Quaternion Polynomials.- Upper Bounds on the Complexity of Some Galois Theory Problems.- Unfolded Modular Multiplication.- Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic.Includes supplementary material: sn.pub/extras
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783319130743 Algorithms and Computation (Chan-Su Shin)
- 9783319130743 Algorithms and Computation (Chan-Su Shin)
- 9780387562797 Algorithms and Computation: Third International Symposium, Isaac '92, Nagoya, Japan, December 16-18, 1992 : Proceedings (Lecture Notes in Computer Science) (Ibaraki, Toshihide Inagaki, Y. Iwana, K. Nishizeki, T.)
- 9780387575681 Algorithms and Computation: 4th International Symposium, Isaac '93 Hong Kong, December 15-17, 1993 : Proceedings (Lecture Notes in Computer Science) (K. W. Ng, P. Raghavan, N. V. Balasubramanian)
- 9780387583259 Algorithms and Computation: 5th International Symposium, Isaac '94, Beijing, P.R. China, August 25-27, 1994 : Proceedings (Lecture Notes in Computer Science, 834) (Zhang, Xiang-Sun, ISAAC 94 (1994 : Beijing, China))
- Algorithms and Computation: 5th International Symposium, ISAAC '94, Beijing, P.R. China, August 25 - 27, 1994. Proceedings (Lecture Notes in Computer Science) (2008-06-13) (unknown)
< zum Archiv...