top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Approximation and Online Algorithms [[electronic resource] ] : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis
Approximation and Online Algorithms [[electronic resource] ] : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Descrizione fisica 1 online resource (286 pages)
Disciplina 516.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Mathematics - Data processing
Computational Mathematics and Numerical Analysis
Algorismes en línia
Optimització matemàtica
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 3-030-92702-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set -- An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation.
Record Nr. UNISA-996464427803316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Approximation and Online Algorithms : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis
Approximation and Online Algorithms : 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021, Revised Selected Papers / / edited by Jochen Koenemann, Britta Peis
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Descrizione fisica 1 online resource (286 pages)
Disciplina 516.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Mathematics - Data processing
Computational Mathematics and Numerical Analysis
Algorismes en línia
Optimització matemàtica
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 3-030-92702-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto How to Navigate Through Obstacles -- Approximation Algorithms for Vertex- Connectivity Augmentation on the Cycle -- Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set -- An Improved Approximation Bound for Minimum Weight Dominating Set on Graphs of Bounded Arboricity -- Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs -- On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem -- The Traveling k-Median Problem: Approximating Optimal Network Coverage -- EPTAS for Load Balancing Problem on Parallel Machines with a Non-renewable Resource -- Several methods of analysis for cardinality constrained bin packing -- Leah Epstein Weighted completion time minimization for capacitated parallel machines -- Server Cloud Scheduling -- FIFO and Randomized Competitive Packet Routing Games -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Online Algorithm for Fractional Knapsack in the Random Order Model -- Improved Analysis of Online Balanced Clustering -- Precedence-Constrained Covering Problems with Multiplicity Constraints -- Contention Resolution, Matrix Scaling and Fair Allocation.
Record Nr. UNINA-9910520076503321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Approximation and Optimization : Algorithms, Complexity and Applications / / edited by Ioannis C. Demetriou, Panos M. Pardalos
Approximation and Optimization : Algorithms, Complexity and Applications / / edited by Ioannis C. Demetriou, Panos M. Pardalos
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (244 pages)
Disciplina 516.11
511.4
Collana Springer Optimization and Its Applications
Soggetto topico Approximation theory
Calculus of variations
Algorithms
Numerical analysis
Probabilities
Approximations and Expansions
Calculus of Variations and Optimal Control; Optimization
Numerical Analysis
Probability Theory and Stochastic Processes
ISBN 3-030-12767-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization using Scaled KKT Conditions and High-order Models -- Data-Dependent Approximation in Social Computing -- Multi-Objective Evolutionary Optimization Algorithms for Machine Learning: a Recent Survey -- No Free Lunch Theorem, a Review -- Piecewise Convex-Concave Approximation in the Minimax Norm -- A Decomposition Theorem for the Least Squares Piecewise Monotonic Data Approximation Problem -- Recent Progress in Optimization of Multiband Electrical Filters -- Impact of Error in Parameter Estimations on Large Scale Portfolio Optimization -- Optimal Design of Smart Composites -- Tax Evasion as an Optimal Solution to a Partially Observable Markov Decision Process.
Record Nr. UNINA-9910338258003321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computing the Continuous Discretely : Integer-Point Enumeration in Polyhedra / / by Matthias Beck, Sinai Robins
Computing the Continuous Discretely : Integer-Point Enumeration in Polyhedra / / by Matthias Beck, Sinai Robins
Autore Beck Matthias
Edizione [2nd ed. 2015.]
Pubbl/distr/stampa New York, NY : , : Springer New York : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (XX, 285 p. 54 illus., 1 illus. in color.)
Disciplina 516.11
Collana Undergraduate Texts in Mathematics
Soggetto topico Combinatorics
Number theory
Convex geometry 
Discrete geometry
Computer mathematics
Number Theory
Convex and Discrete Geometry
Computational Science and Engineering
ISBN 1-4939-2969-0
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The Coin-Exchange Problem of Frobenius -- A Gallery of Discrete Volumes -- Counting Lattice Points in Polytopes: The Ehrhart Theory -- Reciprocity -- Face Numbers and the Dehn–Sommerville Relations in Ehrhartian Terms -- Magic Squares -- Finite Fourier Analysis -- Dedekind Sums -- Zonotopes -- h-Polynomials and h*-Polynomials -- The Decomposition of a Polytope Into Its Cones -- Euler–Maclaurin Summation in Rd -- Solid Angles -- A Discrete Version of Green's Theorem Using Elliptic Functions.
Record Nr. UNINA-9910300255603321
Beck Matthias  
New York, NY : , : Springer New York : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Discrete and Computational Geometry, Graphs, and Games [[electronic resource] ] : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers / / edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno
Discrete and Computational Geometry, Graphs, and Games [[electronic resource] ] : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers / / edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Descrizione fisica 1 online resource (196 pages)
Disciplina 516.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer graphics
Computer science
Computer science—Mathematics
Data structures (Computer science)
Information theory
Computer Graphics
Theory of Computation
Mathematics of Computing
Data Structures and Information Theory
ISBN 3-030-90048-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Geometric Graphs on Point Sets in the Plane -- The Two-distance Sets in Dimension Four -- Negative Instance for the Edge Patrolling Beacon Problem -- Global Location-Domination in the Join and Cartesian Product of Graphs -- The Metric Dimension of the Join of Paths and Cycles -- Barnette’s Conjecture Through the Lens of the ModkP Complexity Classes -- Amiltonicity of graphs on surfaces in terms of toughness and scattering number – A survey -- On Structural Parameterizations of Node Kayles -- Robustness in power-law kinetic systems with reactant-determined interactions -- Toward Unfolding Doubly Covered n-Stars -- Crystallographic Flat Origami from n-Uniform Tilings -- Packing Cube Nets into Rectangles with O(1) Holes -- On the Complexity of Jelly-no-Puzzle -- Computational Complexity of Two Pencil Puzzles.
Record Nr. UNISA-996464386103316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Discrete and Computational Geometry, Graphs, and Games : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers / / edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno
Discrete and Computational Geometry, Graphs, and Games : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers / / edited by Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Descrizione fisica 1 online resource (196 pages)
Disciplina 516.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer graphics
Computer science
Computer science—Mathematics
Data structures (Computer science)
Information theory
Computer Graphics
Theory of Computation
Mathematics of Computing
Data Structures and Information Theory
ISBN 3-030-90048-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Geometric Graphs on Point Sets in the Plane -- The Two-distance Sets in Dimension Four -- Negative Instance for the Edge Patrolling Beacon Problem -- Global Location-Domination in the Join and Cartesian Product of Graphs -- The Metric Dimension of the Join of Paths and Cycles -- Barnette’s Conjecture Through the Lens of the ModkP Complexity Classes -- Amiltonicity of graphs on surfaces in terms of toughness and scattering number – A survey -- On Structural Parameterizations of Node Kayles -- Robustness in power-law kinetic systems with reactant-determined interactions -- Toward Unfolding Doubly Covered n-Stars -- Crystallographic Flat Origami from n-Uniform Tilings -- Packing Cube Nets into Rectangles with O(1) Holes -- On the Complexity of Jelly-no-Puzzle -- Computational Complexity of Two Pencil Puzzles.
Record Nr. UNINA-9910508477603321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Discrete geometry and mathematical morphology : first International Joint Conference, DGMM 2021, Uppsala, Sweden, May 24-27, 2021, proceedings / / Joakim Lindblad, Filip Malmberg, Nataša Sladoje (editors)
Discrete geometry and mathematical morphology : first International Joint Conference, DGMM 2021, Uppsala, Sweden, May 24-27, 2021, proceedings / / Joakim Lindblad, Filip Malmberg, Nataša Sladoje (editors)
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (XIV, 552 p. 194 illus., 146 illus. in color.)
Disciplina 516.11
Collana Lecture Notes in Computer Science
Soggetto topico Discrete geometry
Combinatorial geometry
ISBN 3-030-76657-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited papers -- Some Open Questions on Morphological Operators and Representations in the Deep Learning Era -- Split Trees -A Unifying Model For Many Important Random Trees Of Logarithmic Height: A Brief Survey -- On topological analysis of cells organization in biological images -- Applications in Image Processing, Computer Vision, and Pattern Recognition -- A New Matching Algorithm between Trees of Shapes and its Application to Brain Tumor Segmentation -- Combining Deep Learning and Mathematical Morphology for Historical Map Segmentation -- Automatic forest road extraction from LiDAR data of mountainous areas -- Fast Pattern Spectra using Tree Representation of the Image for Patch Retrieval -- Watershed-based attribute profiles for pixel classification of remote sensing data -- Discrete and Combinatorial Topology -- Completions, perforations and fillings -- Body Centered Cubic Grid --- Coordinate System and Discrete Analytical Plane Definition -- Digital convex + unimodular mapping = almost 4-connected -- Distance-Oriented Surface Skeletonization on the Face-Centered Cubic Grid -- Homotopic Digital Rigid Motion: An Optimization Approach on Cellular Complexes -- Locally turn-bounded curves are quasi-regular -- Discrete Geometry - Models, Transforms, Visualization.-Shear based Bijective Digital Rotation in Hexagonal Grids -- An isometry classification of periodic point sets -- Visiting bijective digitized reflections and rotations using geometric algebra -- Digital Straight Segment Filter for Geometric Description -- An alternative definition for digital convexity -- Digital geometry for the dual of some semi-regular tessellations -- Discrete Tomography and Inverse Problems -- On the geometric aspects of the class of hv-convex switching components -- Properties of unique degree sequences of 3-uniform hypergraphs -- Power sum polynomials in a discrete tomography perspective.-On the reconstruction of 3-uniform hypergraphs from step-two degree sequences.-Hierarchical and Graph-based Models, Analysis and Segmentation -- Towards Interactive Image Segmentation by Dynamic and Iterative Spanning Forest -- Stability of the tree of shapes to additive noise -- An algebraic framework for out-of-core hierarchical segmentation algorithms.-Fuzzy-marker-based segmentation using hierarchies.-Graph-based Supervoxel Computation from Iterative Spanning Forest -- Graph-based M-tortuosity estimation -- A maximum-flow model for digital elastica shape optimization -- Image Segmentation by Relaxed Deep Extreme Cut with Connected Extreme Points -- Learning-based Approaches to Mathematical Morphology -- On some associations between mathematical morphology and artificial intelligence -- Going beyond p-convolutions to learn grayscale morphological operators -- Scale Equivariant Neural Networks with Morphological Scale-Spaces -- Multivariate and PDE-based Mathematical morphology, Morphological Filtering -- Eigenfunctions of Ultrametric Morphological Openings and Closings -- Measuring the Irregularity of Vector-valued Morphological Operators using Wasserstein Metric -- An Equivalence Relation between Morphological Dynamics and Persistent Homology in n-D -- Sparse Approximate Solutions to Max-Plus Equations.
Record Nr. UNINA-9910483027703321
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Discrete geometry and mathematical morphology : first International Joint Conference, DGMM 2021, Uppsala, Sweden, May 24-27, 2021, proceedings / / Joakim Lindblad, Filip Malmberg, Nataša Sladoje (editors)
Discrete geometry and mathematical morphology : first International Joint Conference, DGMM 2021, Uppsala, Sweden, May 24-27, 2021, proceedings / / Joakim Lindblad, Filip Malmberg, Nataša Sladoje (editors)
Edizione [1st ed. 2021.]
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (XIV, 552 p. 194 illus., 146 illus. in color.)
Disciplina 516.11
Collana Lecture Notes in Computer Science
Soggetto topico Discrete geometry
Combinatorial geometry
ISBN 3-030-76657-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited papers -- Some Open Questions on Morphological Operators and Representations in the Deep Learning Era -- Split Trees -A Unifying Model For Many Important Random Trees Of Logarithmic Height: A Brief Survey -- On topological analysis of cells organization in biological images -- Applications in Image Processing, Computer Vision, and Pattern Recognition -- A New Matching Algorithm between Trees of Shapes and its Application to Brain Tumor Segmentation -- Combining Deep Learning and Mathematical Morphology for Historical Map Segmentation -- Automatic forest road extraction from LiDAR data of mountainous areas -- Fast Pattern Spectra using Tree Representation of the Image for Patch Retrieval -- Watershed-based attribute profiles for pixel classification of remote sensing data -- Discrete and Combinatorial Topology -- Completions, perforations and fillings -- Body Centered Cubic Grid --- Coordinate System and Discrete Analytical Plane Definition -- Digital convex + unimodular mapping = almost 4-connected -- Distance-Oriented Surface Skeletonization on the Face-Centered Cubic Grid -- Homotopic Digital Rigid Motion: An Optimization Approach on Cellular Complexes -- Locally turn-bounded curves are quasi-regular -- Discrete Geometry - Models, Transforms, Visualization.-Shear based Bijective Digital Rotation in Hexagonal Grids -- An isometry classification of periodic point sets -- Visiting bijective digitized reflections and rotations using geometric algebra -- Digital Straight Segment Filter for Geometric Description -- An alternative definition for digital convexity -- Digital geometry for the dual of some semi-regular tessellations -- Discrete Tomography and Inverse Problems -- On the geometric aspects of the class of hv-convex switching components -- Properties of unique degree sequences of 3-uniform hypergraphs -- Power sum polynomials in a discrete tomography perspective.-On the reconstruction of 3-uniform hypergraphs from step-two degree sequences.-Hierarchical and Graph-based Models, Analysis and Segmentation -- Towards Interactive Image Segmentation by Dynamic and Iterative Spanning Forest -- Stability of the tree of shapes to additive noise -- An algebraic framework for out-of-core hierarchical segmentation algorithms.-Fuzzy-marker-based segmentation using hierarchies.-Graph-based Supervoxel Computation from Iterative Spanning Forest -- Graph-based M-tortuosity estimation -- A maximum-flow model for digital elastica shape optimization -- Image Segmentation by Relaxed Deep Extreme Cut with Connected Extreme Points -- Learning-based Approaches to Mathematical Morphology -- On some associations between mathematical morphology and artificial intelligence -- Going beyond p-convolutions to learn grayscale morphological operators -- Scale Equivariant Neural Networks with Morphological Scale-Spaces -- Multivariate and PDE-based Mathematical morphology, Morphological Filtering -- Eigenfunctions of Ultrametric Morphological Openings and Closings -- Measuring the Irregularity of Vector-valued Morphological Operators using Wasserstein Metric -- An Equivalence Relation between Morphological Dynamics and Persistent Homology in n-D -- Sparse Approximate Solutions to Max-Plus Equations.
Record Nr. UNISA-996464441103316
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Discrete geometry and optimization / / Karoly Bezdek, Antoine Deza, Yinyu Ye, editors
Discrete geometry and optimization / / Karoly Bezdek, Antoine Deza, Yinyu Ye, editors
Edizione [1st ed. 2013.]
Pubbl/distr/stampa New York, : Springer, 2013
Descrizione fisica 1 online resource (341 p.)
Disciplina 516.11
Altri autori (Persone) BezdekKaroly
YeYinyu
DezaAntoine
Collana Fields Institute communications
Soggetto topico Discrete geometry
Mathematical optimization
ISBN 3-319-00200-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preface -- Discrete Geometry in Minkowski Spaces (Alonso, Martini, and Spirova) -- Engineering Branch-and-Cut Algorithms for the Equicut Program (Anjos, Liers, Pardella, and Schmutzer) -- An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes (Anstreicher) -- On Minimal Tilings with Convex Cells Each Containing a Unit Ball (Bezdek) -- On Volumes of Permutation Polytopes (Burggraf, De Loera, and Omar) -- Monotone Paths in Planar Convex Subdivisions and Polytopes (Dumitrescu, Rote, and Toth).- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Eisenberg-Nagy, Laurent, and Varvitsiotis) -- The Strong Dodecahedral Conjecture and Fejes Toth's Conjecture on Sphere Packings with Kissing Number Twelve (Hales) -- Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints (Jiang, Sun, and Toh) -- Techniques for Submodular Maximization (Lee) -- A Further Generalization of the Colourful Caratheodory theorem (Meunier, Deza) -- Expected Crossing Numbers (Mohar, Stephen) -- EL-Labelings and Canonical Spanning Trees for Subword Complexes (Pilaud, Stump) -- Bandwidth, Vertex Separators, and Eigenvalue Optimization (Rendl, Lisser, and Piacentini) -- Exploiting Symmetries in Polyhedral Computations (Schurmann) -- Conditions for Correct Sensor Network Localization Using SDP Relaxation (Shamsi, Taheri, Zhu, and Ye) -- A Primal-Dual Smooth Perceptron-von Neumann Algorithm (Soheili, Pena) -- Open Problems (Bezdek, Deza, and Ye).   .
Record Nr. UNINA-9910739450003321
New York, : Springer, 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Euclidean Distance Matrices and Their Applications in Rigidity Theory / / by Abdo Y. Alfakih
Euclidean Distance Matrices and Their Applications in Rigidity Theory / / by Abdo Y. Alfakih
Autore Alfakih Abdo Y
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (xiv, 251 pages) : illustrations
Disciplina 516.11
Soggetto topico Statistics 
Convex geometry 
Discrete geometry
Computer science—Mathematics
Statistical Theory and Methods
Convex and Discrete Geometry
Discrete Mathematics in Computer Science
ISBN 3-319-97846-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Chapter 1. Mathematical Preliminaries -- Chapter 2. Positive Semidefinite Matrices -- Chapter 3. Euclidean Distance Matrices (EDMs) -- Chapter 4. Classes of EDMs -- Chapter 5. The Geometry of EDMs -- Chapter 6. The Eigenvalues of EDMs -- Chapter 7. The Entries of EDMs -- Chapter 8. EDM Completions and Bar Frameworks -- Chapter 9. Local and Infinitesimal Rigidities -- Chapter 10. Universal and Dimensional Rigidities -- Epilogue.
Record Nr. UNINA-9910300131503321
Alfakih Abdo Y  
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui