Del i serien Lecture Notes in Computer Science

Algorithms and Computation

Name: Algorithms and Computation
SKU: 9783540771180
Price: 1479 SEK
Availability: InStock
Author: Takeshi Tokuyama
ISBN: 9783540771180

18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings

Häftad, Engelska, 2007

AvTakeshi Tokuyama

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

1 439 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Computation, ISAAC 2007, held in Sendai, Japan, in December 2007. The 77 revised full papers presented together with two invited talks were carefully reviewed and selected from 220 submissions. The papers included topical sections on graph algorithms, computational geometry, complexity, graph drawing, distributed algorithms, optimization, data structure, and game theory.

Produktinformation

Utgivningsdatum2007-11-29
Mått155 x 235 x 51 mm
Vikt1 410 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor929
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540771180

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT

Invited Talk.- Modeling and Analyzing Massive Terrain Data Sets.- Coloring Triangle-Free Graphs on Surfaces.- Best Paper Award Presentation.- Integer Representation and Counting in the Bit Probe Model.- 1A Graph Algorithms I.- Minimum Degree Orderings.- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs.- Dynamic Distance Hereditary Graphs Using Split Decomposition.- Unifying Two Graph Decompositions with Modular Decomposition.- 1B Computational Geometry I.- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem.- Geometric Spanner of Segments.- Dilation-Optimal Edge Deletion in Polygonal Cycles.- 2A Complexity I.- Unbounded-Error Classical and Quantum Communication Complexity.- A Spectral Method for MAX2SAT in the Planted Solution Model.- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices.- The 1-Versus-2 Queries Problem Revisited.- 2B Graph Drawing.- Approximating the Crossing Number of Toroidal Graphs.- Width-Optimal Visibility Representations of Plane Graphs.- Computing Upward Topological Book Embeddings of Upward Planar Digraphs.- Algorithms for the Hypergraph and the Minor Crossing Number Problems.- 3A Distributed Algorithms.- On Mixing and Edge Expansion Properties in Randomized Broadcasting.- Linear Reconfiguration of Cube-Style Modular Robots.- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks.- Sensor Network Gossiping or How to Break the Broadcast Lower Bound.- On the Complexity of the “Most General” Undirected Firing Squad Synchronization Problem.- 3B Optimization I.- Capacitated Domination Problem.- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.- New Bounds for the Nearly EquitableEdge Coloring Problem.- Approximation to the Minimum Cost Edge Installation Problem.- Approximability of Packing Disjoint Cycles.- 4A Data Structure I.- Succinct Representation of Labeled Graphs.- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding.- Kinetic Maintenance of Mobile k-Centres on Trees.- Checking Value-Sensitive Data Structures in Sublinear Space.- 4B Game Theory.- Manipulation in Games.- Using Nash Implementation to Achieve Better Frugality Ratios.- The Price of Nash Equilibria in Multicast Transmissions Games.- 5A Database Applications.- An Efficient Algorithm for Enumerating Pseudo Cliques.- Fast Adaptive Diagnosis with a Minimum Number of Tests.- Dynamic Structures for Top-k Queries on Uncertain Data.- Separating Populations with Wide Data: A Spectral Analysis.- 5B Online Algorithms.- A Constant-Competitive Algorithm for Online OVSF Code Assignment.- Average-Case Analysis of Online Topological Ordering.- Energy Efficient Deadline Scheduling in Two Processor Systems.- On the Relative Dominance of Paging Algorithms.- 6A I/O Algorithms.- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions.- Geometric Streaming Algorithms with a Sorting Primitive.- External Memory Range Reporting on a Grid.- Approximate Range Searching in External Memory.- 6B Networks.- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences.- Hardness and Approximation of Traffic Grooming.- Depth of Field and Cautious-Greedy Routing in Social Networks.- Locating Facilities on a Network to Minimize Their Average Service Radius.- 7A Optimization II.- Faster Combinatorial Algorithms for Determinant and Pfaffian.- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization.-The Parameterized Complexity of the Unique Coverage Problem.- Bounded Tree-Width and CSP-Related Problems.- 7B Computational Geometry II.- Covering Points by Unit Disks of Fixed Location.- Geodesic Disks and Clustering in a Simple Polygon.- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane.- Optimal Triangulation with Steiner Points.- 8A Geometric Applications.- New Algorithm for Field Splitting in Radiation Therapy.- In-Place Algorithm for Image Rotation.- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction.- 8B Data Structures II.- Distributed Relationship Schemes for Trees.- Fast Evaluation of Union-Intersection Expressions.- A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem.- 9A Computational Geometry III.- Compressing Spatio-temporal Trajectories.- Finding Popular Places.- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations.- 9B Complexity II.- The Monomial Ideal Membership Problem and Polynomial Identity Testing.- On the Fault Testing for Reversible Circuits.- The Space Complexity of k-Tree Isomorphism.- 10A String.- Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis.- Space Efficient Indexes for String Matching with Don’t Cares.- 2-Stage Fault Tolerant Interval Group Testing.- Approximate String Matching with Swap and Mismatch.- 10B Graph Algorithms II.- Minimum Fill-In and Treewidth of Split+?ke and Split+?kv Graphs.- Weighted Treewidth Algorithmic Techniques and Results.- Spanning Trees with Many Leaves in Regular Bipartite Graphs.- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs.

Mer från samma författare

Computing and Combinatorics

Takao Asano, Hiroshi Imai, D.T. Lee, Shin-ichi Nakano, Takeshi Tokuyama

Häftad, 1999

749 kr

WALCOM: Algorithms and Computation

Subir Kumar Ghosh, Takeshi Tokuyama

Häftad, 2013

719 kr

Beyond Planar Graphs

Seok-Hee Hong, Takeshi Tokuyama

Inbunden, 2020

1 439 kr

Beyond Planar Graphs

Seok-Hee Hong, Takeshi Tokuyama

Häftad, 2021

1 439 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

969 kr

Algorithms and Computation

18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings

Finns i fler format (10)

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Mer från samma författare

Mer från samma serie

Du kanske också är intresserad av

Algorithms and Computation

18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings

Finns i fler format (10)

Produktinformation

Tillhör följande kategorier

Innehållsförteckning

Mer från samma författare

Mer från samma serie

Du kanske också är intresserad av