Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, proceedings / / edited by Oscar H. Ibarra; Kyung-Yong Chwa
| Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, proceedings / / edited by Oscar H. Ibarra; Kyung-Yong Chwa |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1998] |
| Descrizione fisica | 1 online resource (D, 486 p.) |
| Disciplina | 004.015118 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computer algorithms |
| ISBN | 3-540-49381-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentation -- The Discrepancy Method -- Implementing Algorithms and Data Structures: An Educational and Research Perspective -- Geometry I -- L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing -- Facility Location on Terrains -- Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles -- Complexity I -- Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words -- Disjunctions of Horn Theories and Their Cores -- Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It -- Graph Drawing -- Two-Layer Planarization in Graph Drawing -- Computing Orthogonal Drawings in a Variable Embedding Setting -- Dynamic Grid Embedding with Few Bends and Changes -- On-Line Algorithm and Scheduling -- Two New Families of List Update Algorithms -- An Optimal Algorithm for On-Line Palletizing at Delivery Industry -- On-Line Scheduling of Parallel Jobs with Runtime Restrictions -- CAD/CAM and Graphics -- Testing the Quality of Manufactured Disks and Cylinders -- Casting with Skewed Ejection Direction -- Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image -- Graph Algorithm I -- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph -- Polyhedral Structure of Submodular and Posi-modular Systems -- Maximizing the number of Connections in Optical Tree Networks -- Best Paper Presentation -- Selecting the k Largest Elements with Parity Tests -- Randomized Algorithm -- Randomized K-Dimensional Binary Search Trees -- Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks -- Random Regular Graphs with Edge Faults: Expansion through Cores -- Complexity II -- A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem -- Generalized Graph Colorability and Compressibility of Boolean Formulae -- On the Complexity of Free Monoid Morphisms -- Graph Algorithm II -- Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs -- Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs -- Finding Planar Geometric Automorphisms in Planar Graphs -- Combinatorial Problem -- New Approach for Speeding Up Enumeration Algorithms -- Hamiltonian Decomposition of Recursive Circulants -- Convertibility among Grid Filling Curves -- Geometry II -- Generalized Self-Approaching Curves -- The Steiner Tree Problem in ?4-geometry Plane -- Computational Biology -- Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages -- On the Multiple Gene Duplication Problem -- Geometry III -- Visibility Queries in Simple Polygons and Applications -- Quadtree Decomposition, Steiner Triangulation, and Ray Shooting -- Optimality and Integer Programming Formulations of Triangulations in General Dimension -- Approximation Algorithm -- Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs -- A Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Some Optimum Communication Spanning Tree Problems -- Complexity III -- The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees -- Inapproximability Results for Guarding Polygons without Holes -- The Inapproximability of Non NP-hard Optimization Problems -- Parallel and Distributed Algorithm -- An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate -- A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution -- Optimal Approximate Agreement with Omission Faults. |
| Record Nr. | UNINA-9910143464603321 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [1998] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, proceedings / / edited by Oscar H. Ibarra; Kyung-Yong Chwa
| Algorithms and computation : 9th International Symposium, ISAAC'98, Taejon, Korea, December 14-16, 1998, proceedings / / edited by Oscar H. Ibarra; Kyung-Yong Chwa |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1998] |
| Descrizione fisica | 1 online resource (D, 486 p.) |
| Disciplina | 004.015118 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Computer algorithms |
| ISBN | 3-540-49381-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentation -- The Discrepancy Method -- Implementing Algorithms and Data Structures: An Educational and Research Perspective -- Geometry I -- L? Voronoi Diagrams and Applications to VLSI Layout and Manufacturing -- Facility Location on Terrains -- Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles -- Complexity I -- Maximizing Agreement with a Classification by Bounded or Unbounded number of Associated Words -- Disjunctions of Horn Theories and Their Cores -- Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It -- Graph Drawing -- Two-Layer Planarization in Graph Drawing -- Computing Orthogonal Drawings in a Variable Embedding Setting -- Dynamic Grid Embedding with Few Bends and Changes -- On-Line Algorithm and Scheduling -- Two New Families of List Update Algorithms -- An Optimal Algorithm for On-Line Palletizing at Delivery Industry -- On-Line Scheduling of Parallel Jobs with Runtime Restrictions -- CAD/CAM and Graphics -- Testing the Quality of Manufactured Disks and Cylinders -- Casting with Skewed Ejection Direction -- Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image -- Graph Algorithm I -- k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph -- Polyhedral Structure of Submodular and Posi-modular Systems -- Maximizing the number of Connections in Optical Tree Networks -- Best Paper Presentation -- Selecting the k Largest Elements with Parity Tests -- Randomized Algorithm -- Randomized K-Dimensional Binary Search Trees -- Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks -- Random Regular Graphs with Edge Faults: Expansion through Cores -- Complexity II -- A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem -- Generalized Graph Colorability and Compressibility of Boolean Formulae -- On the Complexity of Free Monoid Morphisms -- Graph Algorithm II -- Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs -- Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs -- Finding Planar Geometric Automorphisms in Planar Graphs -- Combinatorial Problem -- New Approach for Speeding Up Enumeration Algorithms -- Hamiltonian Decomposition of Recursive Circulants -- Convertibility among Grid Filling Curves -- Geometry II -- Generalized Self-Approaching Curves -- The Steiner Tree Problem in ?4-geometry Plane -- Computational Biology -- Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages -- On the Multiple Gene Duplication Problem -- Geometry III -- Visibility Queries in Simple Polygons and Applications -- Quadtree Decomposition, Steiner Triangulation, and Ray Shooting -- Optimality and Integer Programming Formulations of Triangulations in General Dimension -- Approximation Algorithm -- Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs -- A Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Some Optimum Communication Spanning Tree Problems -- Complexity III -- The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees -- Inapproximability Results for Guarding Polygons without Holes -- The Inapproximability of Non NP-hard Optimization Problems -- Parallel and Distributed Algorithm -- An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate -- A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution -- Optimal Approximate Agreement with Omission Faults. |
| Record Nr. | UNISA-996465892203316 |
| Berlin, Germany ; ; New York, New York : , : Springer, , [1998] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Applications of Automata [[electronic resource] ] : 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings / / edited by Oscar H. Ibarra, Bala Ravikumar
| Implementation and Applications of Automata [[electronic resource] ] : 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings / / edited by Oscar H. Ibarra, Bala Ravikumar |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 289 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Compilers (Computer programs) Algorithms Machine theory Theory of Computation Programming Techniques Compilers and Interpreters Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
| ISBN | 3-540-70844-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity -- Language Decompositions, Primality, and Trajectory-Based Operations -- Automata, Probability, and Recursion -- Concurrency, Synchronization, and Conflicts in Petri Nets -- Technical Contributions -- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties -- Antimirov and Mosses’s Rewrite System Revisited -- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata -- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) -- Hopcroft’s Minimization Technique: Queues or Stacks? -- Learning Regular Languages Using Nondeterministic Finite Automata -- Multi-Return Macro Tree Transducers -- Computing Convex Hulls by Automata Iteration -- A Translation from the HTML DTD into a Regular Hedge Grammar -- Tree-Series-to-Tree-Series Transformations -- Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning -- Pattern Matching in DCA Coded Text -- Five Determinisation Algorithms -- Persistent Computations of Turing Machines -- On Complexity of Two Dimensional Languages Generated by Transducers -- Games for Temporal Logics on Trees -- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata -- Composed Bisimulation for Tree Automata -- Hyper-Minimization in O(n 2) -- Deterministic Pushdown Automata and Unary Languages -- Finite Eilenberg Machines -- The Number of Runs in Sturmian Words -- 3-Way Composition of Weighted Finite-State Transducers -- Progressive Solutions to FSM Equations -- Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees -- Approximate Periods with Levenshtein Distance. |
| Record Nr. | UNISA-996465977903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Applications of Automata : 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings / / edited by Oscar H. Ibarra, Bala Ravikumar
| Implementation and Applications of Automata : 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings / / edited by Oscar H. Ibarra, Bala Ravikumar |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 289 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer programming Compilers (Computer programs) Algorithms Machine theory Theory of Computation Programming Techniques Compilers and Interpreters Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
| ISBN | 3-540-70844-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity -- Language Decompositions, Primality, and Trajectory-Based Operations -- Automata, Probability, and Recursion -- Concurrency, Synchronization, and Conflicts in Petri Nets -- Technical Contributions -- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties -- Antimirov and Mosses’s Rewrite System Revisited -- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata -- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) -- Hopcroft’s Minimization Technique: Queues or Stacks? -- Learning Regular Languages Using Nondeterministic Finite Automata -- Multi-Return Macro Tree Transducers -- Computing Convex Hulls by Automata Iteration -- A Translation from the HTML DTD into a Regular Hedge Grammar -- Tree-Series-to-Tree-Series Transformations -- Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning -- Pattern Matching in DCA Coded Text -- Five Determinisation Algorithms -- Persistent Computations of Turing Machines -- On Complexity of Two Dimensional Languages Generated by Transducers -- Games for Temporal Logics on Trees -- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata -- Composed Bisimulation for Tree Automata -- Hyper-Minimization in O(n 2) -- Deterministic Pushdown Automata and Unary Languages -- Finite Eilenberg Machines -- The Number of Runs in Sturmian Words -- 3-Way Composition of Weighted Finite-State Transducers -- Progressive Solutions to FSM Equations -- Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees -- Approximate Periods with Levenshtein Distance. |
| Record Nr. | UNINA-9910484050103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||