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 [[electronic resource] ] : International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings / / edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki
| Algorithms [[electronic resource] ] : International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990. Proceedings / / edited by Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (X, 482 p.) |
| Disciplina | 511/.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Electrical engineering Operations research Decision making Algorithms Combinatorics Theory of Computation Electrical Engineering Operations Research/Decision Theory Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
| ISBN | 3-540-47177-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent progress in string algorithms -- Selection networks -- Computing edge-connectivity in multiple and capacitated graphs -- Efficient sequential and parallel algorithms for planar minimum cost flow -- Structural analyses on the complexity of inverting functions -- Oracles versus proof techniques that do not relativize -- 20-Relative neighborhood graphs are Hamiltonian -- The K-Gabriel graphs and their applications -- Parallel algorithms for generating subsets and set partitions -- Parallel algorithms for linked list and beyond -- Local tournaments and proper circular arc graphs -- Fast algorithms for the dominating set problem on permutation graphs -- Two probabilistic results on merging -- Randomized broadcast in networks -- On the construction of abstract voronoi diagrams, II -- Searching in higher dimension -- Finding extrema with unary predicates -- Implicitly searching convolutions and computing depth of collision -- Characterization for a family of infinitely many irreducible Equally Spaced Polynomials -- Distributed algorithms for deciphering -- An efficient algorithm for optimal loop parallelization (extended abstract) -- Another view on the SSS* algorithm -- Algorithms from complexity theory: Polynomial-time operations for complex sets -- Complexity cores and hard problem instances -- Spatial point location and its applications -- Sublinear merging and natural merge sort -- Constructing strongly convex approximate hulls with inaccurate primitives -- Computing puiseux-series solutions to determinatal equations via combinatorial relaxation -- A tight lower bound on the size of planar permutation networks -- Simultaneous solution of families of problems -- Algorithms for projecting points to give the most uniform distribution with applications to hashing -- Topological sweeping in three dimensions -- Finding least-weight subsequences with fewer processors -- Derandomization by exploiting redundancy and mutual independence -- Planar separators and the Euclidean norm -- On the complexity of isometric embedding in the hypercube -- Distributed function evaluation in the presence of transmission faults -- Optimal linear broadcast -- Graph augmentation problems for a specified set of vertices -- A heuristic algorithm for the k-center problem with vertex weight -- Parallel convexity algorithms for digitized images on a linear array of processors -- Parallel algorithms for labeling image components -- A hyperplane Incidence problem with applications to counting distances -- Splitting a configuration in a simplex -- Weaving patterns of lines and line segments in space -- Efficient parallel algorithms for path problems in planar directed graphs -- Parallel algorithms for finding Steiner forests in planar graphs -- Optimally managing the history of an evolving forest. |
| Record Nr. | UNISA-996465865803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano
| Algorithms and Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XX, 766 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Programming Techniques Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-540-49696-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small–World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid -- Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician’s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session 9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling. |
| Record Nr. | UNISA-996466065303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano
| Algorithms and Computation [[electronic resource] ] : 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings / / edited by Tetsuo Asano |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XX, 766 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Programming Techniques Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-540-49696-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small–World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid -- Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician’s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session 9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling. |
| Record Nr. | UNINA-9910484314703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri
| Algorithms and Computation [[electronic resource] ] : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings / / edited by Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (X, 458 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer communication systems Computer graphics Computer mathematics Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Computer Communication Networks Computer Graphics Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-49633-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications of a numbering scheme for polygonal obstacles in the plane -- Multicast communication in high speed networks -- Incremental convex hull algorithms are not output sensitive -- Separating and shattering long line segments -- Optimal line bipartitions of point sets -- Interval finding and its application to data mining -- On the approximability of the Steiner tree problem in phylogeny -- Approximation and special cases of common subtrees and editing distance -- Two-dimensional dynamic dictionary matching -- Discovering unbounded unions of regular pattern languages from positive examples -- Extremal problems for geometric hypergraphs -- Computing fair and bottleneck matchings in geometric graphs -- Computing the maximum overlap of two convex polygons under translations -- OBDDs of a monotone function and of its prime implicants -- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs -- Graph searching on chordal graphs -- An algorithm for enumerating all directed spanning trees in a directed graph -- Vertex ranking of asteroidal triple-free graphs -- Recursively divisible problems -- StUSPACE(log n) ?-DSPACE(log2 n/log log n) -- Finding edge-disjoint paths in partial k-trees -- Optimal augmentation for bipartite componentwise biconnectivity in linear time -- Towards more precise parallel biconnectivity approximation -- The complexity of probabilistic versus deterministic finite automata -- Bounded length UCFG equivalence -- The Steiner Minimal Tree problem in the ?-geometry plane -- A study of the LMT-skeleton -- A new subgraph of minimum weight triangulations -- Dynamic tree routing under the “matching with consumption” model -- Dimension-exchange token distribution on the mesh and the torus -- Directed hamiltonian packing in d-dimensional meshes and its application -- k-pairs non-crossing shortest paths in a simple polygon -- Minimum convex partition of a polygon with holes by cuts in given directions -- Efficient list ranking on the reconfigurable mesh, with applications -- Periodic merging networks -- Minimizing wavelengths in an all-optical ring network -- Competitive analysis of on-line disk scheduling -- Scheduling interval ordered tasks with non-uniform deadlines -- Cryptographic weaknesses in the round transformation used in a block cipher with provable immunity against linear cryptanalysis -- The multi-variable modular polynomial and its applications to cryptography -- Bounds and algorithms for a practical task allocation model (extended abstract) -- Scheduling algorithms for strict multithreaded computations -- On multi-threaded Paging -- A fast and efficient homophonic coding algorithm -- An improvement of the digital cash protocol of Okamoto and Ohta. |
| Record Nr. | UNISA-996465977303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Geometry, Morphology, and Computational Imaging [[electronic resource] ] : 11th International Workshop on Theoretical Foundations of Computer Vision, Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers / / edited by Tetsuo Asano, Reinhard Klette, Christian Ronse
| Geometry, Morphology, and Computational Imaging [[electronic resource] ] : 11th International Workshop on Theoretical Foundations of Computer Vision, Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers / / edited by Tetsuo Asano, Reinhard Klette, Christian Ronse |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (X, 446 p.) |
| Disciplina | 006.3/7 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Optical data processing
Computer graphics Image Processing and Computer Vision Computer Graphics |
| ISBN | 3-540-36586-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Flat Morphological Operators on Arbitrary Power Lattices -- Quantification of the Spatial Distribution of Line Segments with Applications to CAD of Chest X-Ray CT Images -- Fan Clouds - An Alternative to Meshes -- Combinatorial and Geometric Problems Related to Digital Halftoning -- All Points Considered: A Maximum Likelihood Method for Motion Recovery -- Distance Map Based Enhancement for Interpolated Images -- Multigrid Convergence and Surface Area Estimation -- Geometric Structure and Randomness in Texture Analysis and Synthesis -- Morphological Texture Analysis Using Optimization of Structuring Elements -- Unifying Quantitative, Semi-quantitative and Qualitative Spatial Relation Knowledge Representations Using Mathematical Morphology -- A New Class of Morphological Pyramids for Multiresolution Image Analysis -- Root Images of Median Filters — Semi-topological Approach -- Medial Set, Boundary, and Topology of Random Point Sets -- Scale-Based Corner Extraction of a Contour Figure Using a Crystalline Flow -- Hyperfigures and Their Interpretations -- Polygon Decomposition Based on the Straight Line Skeleton -- Reestablishing Consistency of Uncertain Geometric Relations in Digital Images -- Inverse Quantization for Resolution Conversion -- Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization -- Deriving Topological Representations from Edge Images -- Calibration of Panoramic Cameras Using 3D Scene Information -- Quantitative Depth Recovery from Time-Varying Optical Flow in a Kalman Filter Framework -- From Digital Plane Segmentation to Polyhedral Representation -- Lines as the Fundamental Unit of Vision -- Topological Analysis and Characterization of Discrete Scalar Fields -- External versus Internal Parameterizations for Lengths of Curves with Nonuniform Samplings -- Denoising Images: Non-linear Leap-Frog for Shape and Light-Source Recovery. |
| Record Nr. | UNINA-9910143889103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Geometry, Morphology, and Computational Imaging [[electronic resource] ] : 11th International Workshop on Theoretical Foundations of Computer Vision, Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers / / edited by Tetsuo Asano, Reinhard Klette, Christian Ronse
| Geometry, Morphology, and Computational Imaging [[electronic resource] ] : 11th International Workshop on Theoretical Foundations of Computer Vision, Dagstuhl Castle, Germany, April 7-12, 2002, Revised Papers / / edited by Tetsuo Asano, Reinhard Klette, Christian Ronse |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (X, 446 p.) |
| Disciplina | 006.3/7 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Optical data processing
Computer graphics Image Processing and Computer Vision Computer Graphics |
| ISBN | 3-540-36586-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Flat Morphological Operators on Arbitrary Power Lattices -- Quantification of the Spatial Distribution of Line Segments with Applications to CAD of Chest X-Ray CT Images -- Fan Clouds - An Alternative to Meshes -- Combinatorial and Geometric Problems Related to Digital Halftoning -- All Points Considered: A Maximum Likelihood Method for Motion Recovery -- Distance Map Based Enhancement for Interpolated Images -- Multigrid Convergence and Surface Area Estimation -- Geometric Structure and Randomness in Texture Analysis and Synthesis -- Morphological Texture Analysis Using Optimization of Structuring Elements -- Unifying Quantitative, Semi-quantitative and Qualitative Spatial Relation Knowledge Representations Using Mathematical Morphology -- A New Class of Morphological Pyramids for Multiresolution Image Analysis -- Root Images of Median Filters — Semi-topological Approach -- Medial Set, Boundary, and Topology of Random Point Sets -- Scale-Based Corner Extraction of a Contour Figure Using a Crystalline Flow -- Hyperfigures and Their Interpretations -- Polygon Decomposition Based on the Straight Line Skeleton -- Reestablishing Consistency of Uncertain Geometric Relations in Digital Images -- Inverse Quantization for Resolution Conversion -- Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization -- Deriving Topological Representations from Edge Images -- Calibration of Panoramic Cameras Using 3D Scene Information -- Quantitative Depth Recovery from Time-Varying Optical Flow in a Kalman Filter Framework -- From Digital Plane Segmentation to Polyhedral Representation -- Lines as the Fundamental Unit of Vision -- Topological Analysis and Characterization of Discrete Scalar Fields -- External versus Internal Parameterizations for Lengths of Curves with Nonuniform Samplings -- Denoising Images: Non-linear Leap-Frog for Shape and Light-Source Recovery. |
| Record Nr. | UNISA-996465770103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||