Info
Algorithmic Aspects in Information and Management [[electronic resource] ] : 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings / / edited by Zhao Zhang, Wei Li, Ding-Zhu Du
| Algorithmic Aspects in Information and Management [[electronic resource] ] : 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings / / edited by Zhao Zhang, Wei Li, Ding-Zhu Du |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XI, 640 p. 151 illus., 61 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Data structures (Computer science) Information theory Data mining Discrete Mathematics in Computer Science Data Structures and Information Theory Data Mining and Knowledge Discovery |
| ISBN | 3-030-57602-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polynomial-time algorithms for the touring rays and related problems -- Polyhedral Circuits and Their Applications -- Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation -- Approximation Algorithm for Stochastic Set Cover Problem -- On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane -- Minimum Diameter Vertex-Weighted Steiner Tree -- Community-based Rumor Blocking Maximization in Social Networks -- Improved hardness and approximation results for single allocationhub location -- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs -- 2-Level Station Location for Bike Sharing -- Approximation Algorithms for the Lower-Bounded Knapsack Median Problem -- The spherical k-means++ algorithm via local search -- Local search algorithm for the spherical k-means problem with outliers -- A Bi-Criteria Analysis for Fuzzy C-means Problem -- Approximating Max k-Uncut via LP-rounding plus Greed, with Applications to Densest k-Subgraph -- Online BP functions maximization -- Adaptive Robust Submodular Optimization and Beyond -- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint -- Fast Algorithms for Maximizing Monotone Nonsubmodular Functions -- Non-Submodular Streaming Maximization with Minimum Memory and Low Adaptive Complexity -- On Fixed-order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering -- Selfish Bin Packing with Parameterized Punishment -- Multiple Facility Location Games with Envy Ratio -- Strategyproof Mechanisms for 2-facility Location Games with Minimax Envy -- Robustness and Approximation for the Linear Contract Design -- Scheduling many types of calibrations -- Efficient mobile charger scheduling in large-scale sensor networks -- Revisit of the Scheduling Problems with Integrated Production and Delivery on Parallel Batching Machines -- Range Partitioning within Sublinear Time in the External Memory Model -- New Results on the Complexity of Deletion Propagation -- Search Complexity: A Way for The Quantitative Analysis of The Search Space -- Multi-AGVs Pathfinding based on Improved Jump Point Search in Logistic Center -- Distance-based Adaptive Large Neighborhood Search Algorithm for Green-PDPTW -- The theories of a novel filled function method for non-smooth global optimization -- Complexity of tree-coloring interval graphs equitably -- Approximation algorithms for balancing signed graphs -- Computing the One-Visibility Copnumber of Trees -- Maximum subgraphs in Ramsey graphs -- Independent perfect domination sets in Semi-Cayley graphs -- A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Crossed Cubes -- Antipodal radio labelling of full binary trees -- Total coloring of outer-1-planar graphs: the cold case -- Edge-face list coloring of Halin graphs -- Injective Coloring of Halin Graphs -- The list L(2, 1)-labeling of planar graphs with large girth -- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem -- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery -- A Batch Scheduling Problem of Automatic Drug Dispensing System in Outpatient Pharmacy -- A two-stage medical expenses estimation model for inpatients during diagnosis process under artificial intelligence environment -- The Early-Warning Model of Evaluation and Prevention for Venous Thromboembolism in Gynecological Tumor Surgical Patients based on WSOM -- The coordinated decisions of service supply chain between tumor healthcare alliance and patients under government intervention -- Medical data compression and sharing technology based on blockchain -- Model Establishment and Algorithm Research of Tumor Marker Combination Prediction for Colorectal Cancer -- Safety Evaluation and Lean Disposal of Clinical Waste in Outpatient and Emergency Department of Large Hospitals -- Effects of Taiji on Participants' Knees: A Behavioral-Modeling Approach -- Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree. |
| Record Nr. | UNISA-996418321103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Aspects in Information and Management : 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings / / edited by Zhao Zhang, Wei Li, Ding-Zhu Du
| Algorithmic Aspects in Information and Management : 14th International Conference, AAIM 2020, Jinhua, China, August 10–12, 2020, Proceedings / / edited by Zhao Zhang, Wei Li, Ding-Zhu Du |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XI, 640 p. 151 illus., 61 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Data structures (Computer science) Information theory Data mining Discrete Mathematics in Computer Science Data Structures and Information Theory Data Mining and Knowledge Discovery |
| ISBN | 3-030-57602-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polynomial-time algorithms for the touring rays and related problems -- Polyhedral Circuits and Their Applications -- Online Bicriteria Algorithms to Balance Coverage and Cost in Team Formation -- Approximation Algorithm for Stochastic Set Cover Problem -- On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane -- Minimum Diameter Vertex-Weighted Steiner Tree -- Community-based Rumor Blocking Maximization in Social Networks -- Improved hardness and approximation results for single allocationhub location -- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs -- 2-Level Station Location for Bike Sharing -- Approximation Algorithms for the Lower-Bounded Knapsack Median Problem -- The spherical k-means++ algorithm via local search -- Local search algorithm for the spherical k-means problem with outliers -- A Bi-Criteria Analysis for Fuzzy C-means Problem -- Approximating Max k-Uncut via LP-rounding plus Greed, with Applications to Densest k-Subgraph -- Online BP functions maximization -- Adaptive Robust Submodular Optimization and Beyond -- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint -- Fast Algorithms for Maximizing Monotone Nonsubmodular Functions -- Non-Submodular Streaming Maximization with Minimum Memory and Low Adaptive Complexity -- On Fixed-order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering -- Selfish Bin Packing with Parameterized Punishment -- Multiple Facility Location Games with Envy Ratio -- Strategyproof Mechanisms for 2-facility Location Games with Minimax Envy -- Robustness and Approximation for the Linear Contract Design -- Scheduling many types of calibrations -- Efficient mobile charger scheduling in large-scale sensor networks -- Revisit of the Scheduling Problems with Integrated Production and Delivery on Parallel Batching Machines -- Range Partitioning within Sublinear Time in the External Memory Model -- New Results on the Complexity of Deletion Propagation -- Search Complexity: A Way for The Quantitative Analysis of The Search Space -- Multi-AGVs Pathfinding based on Improved Jump Point Search in Logistic Center -- Distance-based Adaptive Large Neighborhood Search Algorithm for Green-PDPTW -- The theories of a novel filled function method for non-smooth global optimization -- Complexity of tree-coloring interval graphs equitably -- Approximation algorithms for balancing signed graphs -- Computing the One-Visibility Copnumber of Trees -- Maximum subgraphs in Ramsey graphs -- Independent perfect domination sets in Semi-Cayley graphs -- A Parallel Algorithm for Constructing Two Edge-disjoint Hamiltonian Cycles in Crossed Cubes -- Antipodal radio labelling of full binary trees -- Total coloring of outer-1-planar graphs: the cold case -- Edge-face list coloring of Halin graphs -- Injective Coloring of Halin Graphs -- The list L(2, 1)-labeling of planar graphs with large girth -- The frequency of the optimal Hamiltonian cycle computed with frequency quadrilaterals for traveling salesman problem -- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery -- A Batch Scheduling Problem of Automatic Drug Dispensing System in Outpatient Pharmacy -- A two-stage medical expenses estimation model for inpatients during diagnosis process under artificial intelligence environment -- The Early-Warning Model of Evaluation and Prevention for Venous Thromboembolism in Gynecological Tumor Surgical Patients based on WSOM -- The coordinated decisions of service supply chain between tumor healthcare alliance and patients under government intervention -- Medical data compression and sharing technology based on blockchain -- Model Establishment and Algorithm Research of Tumor Marker Combination Prediction for Colorectal Cancer -- Safety Evaluation and Lean Disposal of Clinical Waste in Outpatient and Emergency Department of Large Hospitals -- Effects of Taiji on Participants' Knees: A Behavioral-Modeling Approach -- Mixed Distribution of Relief Materials with the Consideration of Demand Matching Degree. |
| Record Nr. | UNINA-9910416082603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Aspects in Information and Management [[electronic resource] ] : 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / / edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang
| Algorithmic Aspects in Information and Management [[electronic resource] ] : 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / / edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (IX, 354 p. 67 illus., 9 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Numerical analysis Algorithms Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-030-27195-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | One-Dimensional r -Gathering under Uncertainty -- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees -- A Probabilistic Algorithm for Verification of Geometric Theorems -- Approximating Closest Vector Problem in infinte Norm Revisited -- Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable -- Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs -- Updating Matrix Polynomials -- On the Structure of Discrete Metric Spaces Isometric to Circles -- A 2.57-Approximation Algorithm for Contig-based Genomic Scaffold Filling -- Profit Parameterizations of Dominating Set -- Exponential Time Approximation Scheme for TSP -- Interaction-aware Influence Maximization and Iterated Sandwich Method -- An approximation algorithm of the edge metric dimension problem -- The Seeding Algorithm for Spherical k-Means Clustering with Penalties -- Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes -- Two-Way Currency Trading Algorithms in the Discrete Setting -- Approximation Algorithms for the Minimum Power Partial Cover Problem -- On approximations for constructing required subgraphs using stock pieces of fixed length -- A primal dual approximation algorithm for the multicut problem in trees with submodular penalties -- Algorithm aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs -- Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks -- Locality Sensitive Algotrithms for Data Mule Routing Problem -- Maximize a Monotone Function with a Generic Submodularity Ratio -- Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem -- A general framework for path convexities -- An approximation algorithm for the dynamic k-level facility location problem -- Weighted Two-Dimensional Finite Automata -- Improved Parameterized Algorithms for Mixed Domination -- New Results on the Zero-Visibility Cops and Robber Game -- A two-stage constrained submodular maximization -- Local search approximation algorithms for the spherical k-means problem. |
| Record Nr. | UNISA-996466449703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Aspects in Information and Management : 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / / edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang
| Algorithmic Aspects in Information and Management : 13th International Conference, AAIM 2019, Beijing, China, August 6–8, 2019, Proceedings / / edited by Ding-Zhu Du, Lian Li, Xiaoming Sun, Jialin Zhang |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (IX, 354 p. 67 illus., 9 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Numerical analysis Algorithms Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-030-27195-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | One-Dimensional r -Gathering under Uncertainty -- Improved Algorithms for Ranking and Unranking (k,m)-Ary Trees -- A Probabilistic Algorithm for Verification of Geometric Theorems -- Approximating Closest Vector Problem in infinte Norm Revisited -- Low-Dimensional Vectors with Density Bounded by 5/6 are Pinwheel Schedulable -- Constant-Factor Greedy Algorithms for the Asymmetric p -Center Problem in Parameterized Complete Digraphs -- Updating Matrix Polynomials -- On the Structure of Discrete Metric Spaces Isometric to Circles -- A 2.57-Approximation Algorithm for Contig-based Genomic Scaffold Filling -- Profit Parameterizations of Dominating Set -- Exponential Time Approximation Scheme for TSP -- Interaction-aware Influence Maximization and Iterated Sandwich Method -- An approximation algorithm of the edge metric dimension problem -- The Seeding Algorithm for Spherical k-Means Clustering with Penalties -- Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes -- Two-Way Currency Trading Algorithms in the Discrete Setting -- Approximation Algorithms for the Minimum Power Partial Cover Problem -- On approximations for constructing required subgraphs using stock pieces of fixed length -- A primal dual approximation algorithm for the multicut problem in trees with submodular penalties -- Algorithm aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs -- Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks -- Locality Sensitive Algotrithms for Data Mule Routing Problem -- Maximize a Monotone Function with a Generic Submodularity Ratio -- Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem -- A general framework for path convexities -- An approximation algorithm for the dynamic k-level facility location problem -- Weighted Two-Dimensional Finite Automata -- Improved Parameterized Algorithms for Mixed Domination -- New Results on the Zero-Visibility Cops and Robber Game -- A two-stage constrained submodular maximization -- Local search approximation algorithms for the spherical k-means problem. |
| Record Nr. | UNINA-9910349308403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic Aspects in Information and Management [[electronic resource] ] : 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings / / edited by Shaojie Tang, Ding-Zhu Du, David Woodruff, Sergiy Butenko
| Algorithmic Aspects in Information and Management [[electronic resource] ] : 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings / / edited by Shaojie Tang, Ding-Zhu Du, David Woodruff, Sergiy Butenko |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (VIII, 320 p. 77 illus., 31 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Numerical analysis Artificial intelligence Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Artificial Intelligence Data Science |
| ISBN | 3-030-04618-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Minimum Diameter $k$-Steiner Forest -- Factors Impacting the Label Denoising of Neural Relation Extraction -- Makespan Minimization on Unrelated Parallel Machines with a Few Bags -- Channel Assignment with r-Dynamic Coloring -- Profit Maximization Problem with Coupons in Social Networks -- A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem -- A Novel Approach to Verifying Context Free Properties of Programs -- Determination of Dual Distances for a Kind of Perfect Mixed Codes -- Approximation and Competitive Algorithms for Single-Minded Selling Problem -- An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints -- Quality-aware Online Task Assignment Using Latent Topic Model -- Calibration Scheduling with Time Slot Cost -- The k-power domination problem in weighted trees -- General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach -- A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTE-A Network -- Faster Compression of Patterns to Rectangle Rule Lists -- Algorithm Designs for Dynamic Ridesharing System -- New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems -- Computation of Kullback-Leibler Divergence between Labeled Stochastic Systems with Non-Identical State Spaces -- Order preserving barrier coverage with weighted sensors on a line -- Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing -- Approximation algorithms and a hardness result for the three-machine proportionate mixed-shop problem -- A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory -- Community-based Acceptance Probability Maximization for Target Users on Social Networks -- Knowledge Graph Embedding Based on Subgraph-aware Proximity. |
| Record Nr. | UNISA-996466280403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Aspects in Information and Management : 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings / / edited by Shaojie Tang, Ding-Zhu Du, David Woodruff, Sergiy Butenko
| Algorithmic Aspects in Information and Management : 12th International Conference, AAIM 2018, Dallas, TX, USA, December 3–4, 2018, Proceedings / / edited by Shaojie Tang, Ding-Zhu Du, David Woodruff, Sergiy Butenko |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (VIII, 320 p. 77 illus., 31 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Numerical analysis Artificial intelligence Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Artificial Intelligence Data Science |
| ISBN | 3-030-04618-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Minimum Diameter $k$-Steiner Forest -- Factors Impacting the Label Denoising of Neural Relation Extraction -- Makespan Minimization on Unrelated Parallel Machines with a Few Bags -- Channel Assignment with r-Dynamic Coloring -- Profit Maximization Problem with Coupons in Social Networks -- A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem -- A Novel Approach to Verifying Context Free Properties of Programs -- Determination of Dual Distances for a Kind of Perfect Mixed Codes -- Approximation and Competitive Algorithms for Single-Minded Selling Problem -- An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints -- Quality-aware Online Task Assignment Using Latent Topic Model -- Calibration Scheduling with Time Slot Cost -- The k-power domination problem in weighted trees -- General Rumor Blocking: An Efficient Random Algorithm with Martingale Approach -- A Robust Power Optimization Algorithm to Balance Base Stations' Load in LTE-A Network -- Faster Compression of Patterns to Rectangle Rule Lists -- Algorithm Designs for Dynamic Ridesharing System -- New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems -- Computation of Kullback-Leibler Divergence between Labeled Stochastic Systems with Non-Identical State Spaces -- Order preserving barrier coverage with weighted sensors on a line -- Achieving Location Truthfulness in Rebalancing Supply-Demand Distribution for Bike Sharing -- Approximation algorithms and a hardness result for the three-machine proportionate mixed-shop problem -- A New Algorithm Design Technique for Hard Problems, Building on Methods of Complexity Theory -- Community-based Acceptance Probability Maximization for Target Users on Social Networks -- Knowledge Graph Embedding Based on Subgraph-aware Proximity. |
| Record Nr. | UNINA-9910349391603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings / / edited by Ying Fei Dong, Ding-Zhu Du, Oscar H. Ibarra
| Algorithms and Computation [[electronic resource] ] : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings / / edited by Ying Fei Dong, Ding-Zhu Du, Oscar H. Ibarra |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XXIX, 1228 p.) |
| Disciplina | 004n/a |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence—Data processing
Computer science—Mathematics Mathematics—Data processing Algorithms Discrete mathematics Data Science Mathematics of Computing Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN |
1-280-38331-3
9786613561237 3-642-10631-5 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Bubblesort and Juggling Sequences -- A Proof of the Molecular Conjecture -- Exact Algorithms for Dominating Clique Problems -- Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming -- Exact Algorithms for the Bottleneck Steiner Tree Problem -- Exact Algorithms for Set Multicover and Multiset Multicover Problems -- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm -- Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems -- On Protein Structure Alignment under Distance Constraint -- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability -- Max-Coloring Paths: Tight Bounds and Extensions -- Fréchet Distance Problems in Weighted Regions -- The Complexity of Solving Stochastic Games on Graphs -- Computational Complexity of Cast Puzzles -- New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body -- Reconstructing Numbers from Pairwise Function Values -- Hilbert’s Thirteenth Problem and Circuit Complexity -- Interval Stabbing Problems in Small Integer Ranges -- Online Sorted Range Reporting -- Data Structures for Approximate Orthogonal Range Counting -- Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time -- Untangled Monotonic Chains and Adaptive Range Search -- Geodesic Spanners on Polyhedral Surfaces -- Approximating Points by a Piecewise Linear Function: I -- Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers -- Computing the Map of Geometric Minimal Cuts -- On the Camera Placement Problem -- Graph Orientations with Set Connectivity Requirements -- A Linear Vertex Kernel for Maximum Internal Spanning Tree -- Geometric Minimum Diameter Minimum Cost Spanning Tree Problem -- On Shortest Disjoint Paths in Planar Graphs -- An Optimal Labeling for Node Connectivity -- SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks -- 1-Bounded Space Algorithms for 2-Dimensional Bin Packing -- On the Advice Complexity of Online Problems -- Online Knapsack Problems with Limited Cuts -- Online Paging for Flash Memory Devices -- Shifting Strategy for Geometric Graphs without Geometry -- Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics -- Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time -- Minimum Covering with Travel Cost -- Route-Enabling Graph Orientation Problems -- Complexity of Approximating the Vertex Centroid of a Polyhedron -- Popular Matchings with Variable Job Capacities -- On the Tightness of the Buhrman-Cleve-Wigderson Simulation -- Bounds on Contention Management Algorithms -- Algorithmic Folding Complexity -- Min-Energy Scheduling for Aligned Jobs in Accelerate Model -- Posi-modular Systems with Modulotone Requirements under Permutation Constraints -- Generalized Reduction to Compute Toric Ideals -- Linear and Sublinear Time Algorithms for Basis of Abelian Groups -- Good Programming in Transactional Memory -- Induced Packing of Odd Cycles in a Planar Graph -- On the Infinitesimal Rigidity of Bar-and-Slider Frameworks -- Exploration of Periodically Varying Graphs -- Parameterized Complexity of Arc-Weighted Directed Steiner Problems -- Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries -- Minimum Cycle Bases of Weighted Outerplanar Graphs -- Bandwidth on AT-Free Graphs -- Editing Graphs into Disjoint Unions of Dense Clusters -- A Certifying Algorithm for 3-Colorability of P 5-Free Graphs -- Parameterizing Cut Sets in a Graph by the Number of Their Components -- Inapproximability of Maximal Strip Recovery -- The Complexity of Perfect Matching Problems on Dense Hypergraphs -- On Lower Bounds for Constant Width Arithmetic Circuits -- Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria -- The Identity Correspondence Problem and Its Applications -- Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs -- An Improved Approximation Algorithm for the Traveling Tournament Problem -- The Fault-Tolerant Facility Allocation Problem -- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks -- Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms -- The Directed Hausdorff Distance between Imprecise Point Sets -- Computing Multidimensional Persistence -- Locating an Obnoxious Line among Planar Objects -- Finding Fullerene Patches in Polynomial Time -- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids -- A Self-stabilizing and Local Delaunay Graph Construction -- Succinct Greedy Geometric Routing in the Euclidean Plane -- Electric Routing and Concurrent Flow Cutting -- A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths -- Strong Robustness of Randomized Rumor Spreading Protocols -- Data Structures for Range Median Queries -- Deletion without Rebalancing in Multiway Search Trees -- Counting in the Presence of Memory Faults -- A Simple, Fast, and Compact Static Dictionary -- Reconstructing Polygons from Scanner Data -- Computing Large Matchings in Planar Graphs with Fixed Minimum Degree -- Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs -- Covering a Graph with a Constrained Forest (Extended Abstract) -- Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs -- Upward Star-Shaped Polyhedral Graphs -- Conditional Hardness of Approximating Satisfiable Max 3CSP-q -- The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract) -- Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement -- Step-Assembly with a Constant Number of Tile Types -- Lower Bounds on Fast Searching -- Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity -- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1?+?? ) Time -- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k -- Optimal Randomized Algorithm for the Density Selection Problem -- New Results on Simple Stochastic Games -- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences -- Succinct Index for Dynamic Dictionary Matching -- Range Non-overlapping Indexing -- Querying Two Boundary Points for Shortest Paths in a Polygonal Domain -- Pattern Matching for 321-Avoiding Permutations -- Folding a Better Checkerboard -- Finding All Approximate Gapped Palindromes -- General Pseudo-random Generators from Weaker Models of Computation -- Random Generation and Enumeration of Bipartite Permutation Graphs -- A Combinatorial Algorithm for Horn Programs -- Online Maximum Directed Cut -- Maintaining Nets and Net Trees under Incremental Motion -- Distributed Scheduling of Parallel Hybrid Computations -- I/O-Efficient Contour Tree Simplification -- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes -- I/O and Space-Efficient Path Traversal in Planar Graphs -- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model -- Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) -- Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets -- On Partitioning a Graph into Two Connected Subgraphs. |
| Record Nr. | UNISA-996465913603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings / / edited by Ying Fei Dong, Ding-Zhu Du, Oscar H. Ibarra
| Algorithms and Computation : 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings / / edited by Ying Fei Dong, Ding-Zhu Du, Oscar H. Ibarra |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XXIX, 1228 p.) |
| Disciplina | 004n/a |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Artificial intelligence—Data processing
Computer science—Mathematics Mathematics—Data processing Algorithms Discrete mathematics Data Science Mathematics of Computing Computational Mathematics and Numerical Analysis Discrete Mathematics in Computer Science |
| ISBN |
1-280-38331-3
9786613561237 3-642-10631-5 |
| Classificazione |
DAT 530f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Bubblesort and Juggling Sequences -- A Proof of the Molecular Conjecture -- Exact Algorithms for Dominating Clique Problems -- Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming -- Exact Algorithms for the Bottleneck Steiner Tree Problem -- Exact Algorithms for Set Multicover and Multiset Multicover Problems -- Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm -- Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems -- On Protein Structure Alignment under Distance Constraint -- A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability -- Max-Coloring Paths: Tight Bounds and Extensions -- Fréchet Distance Problems in Weighted Regions -- The Complexity of Solving Stochastic Games on Graphs -- Computational Complexity of Cast Puzzles -- New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body -- Reconstructing Numbers from Pairwise Function Values -- Hilbert’s Thirteenth Problem and Circuit Complexity -- Interval Stabbing Problems in Small Integer Ranges -- Online Sorted Range Reporting -- Data Structures for Approximate Orthogonal Range Counting -- Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time -- Untangled Monotonic Chains and Adaptive Range Search -- Geodesic Spanners on Polyhedral Surfaces -- Approximating Points by a Piecewise Linear Function: I -- Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers -- Computing the Map of Geometric Minimal Cuts -- On the Camera Placement Problem -- Graph Orientations with Set Connectivity Requirements -- A Linear Vertex Kernel for Maximum Internal Spanning Tree -- Geometric Minimum Diameter Minimum Cost Spanning Tree Problem -- On Shortest Disjoint Paths in Planar Graphs -- An Optimal Labeling for Node Connectivity -- SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks -- 1-Bounded Space Algorithms for 2-Dimensional Bin Packing -- On the Advice Complexity of Online Problems -- Online Knapsack Problems with Limited Cuts -- Online Paging for Flash Memory Devices -- Shifting Strategy for Geometric Graphs without Geometry -- Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics -- Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time -- Minimum Covering with Travel Cost -- Route-Enabling Graph Orientation Problems -- Complexity of Approximating the Vertex Centroid of a Polyhedron -- Popular Matchings with Variable Job Capacities -- On the Tightness of the Buhrman-Cleve-Wigderson Simulation -- Bounds on Contention Management Algorithms -- Algorithmic Folding Complexity -- Min-Energy Scheduling for Aligned Jobs in Accelerate Model -- Posi-modular Systems with Modulotone Requirements under Permutation Constraints -- Generalized Reduction to Compute Toric Ideals -- Linear and Sublinear Time Algorithms for Basis of Abelian Groups -- Good Programming in Transactional Memory -- Induced Packing of Odd Cycles in a Planar Graph -- On the Infinitesimal Rigidity of Bar-and-Slider Frameworks -- Exploration of Periodically Varying Graphs -- Parameterized Complexity of Arc-Weighted Directed Steiner Problems -- Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries -- Minimum Cycle Bases of Weighted Outerplanar Graphs -- Bandwidth on AT-Free Graphs -- Editing Graphs into Disjoint Unions of Dense Clusters -- A Certifying Algorithm for 3-Colorability of P 5-Free Graphs -- Parameterizing Cut Sets in a Graph by the Number of Their Components -- Inapproximability of Maximal Strip Recovery -- The Complexity of Perfect Matching Problems on Dense Hypergraphs -- On Lower Bounds for Constant Width Arithmetic Circuits -- Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria -- The Identity Correspondence Problem and Its Applications -- Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs -- An Improved Approximation Algorithm for the Traveling Tournament Problem -- The Fault-Tolerant Facility Allocation Problem -- Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks -- Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms -- The Directed Hausdorff Distance between Imprecise Point Sets -- Computing Multidimensional Persistence -- Locating an Obnoxious Line among Planar Objects -- Finding Fullerene Patches in Polynomial Time -- Convex Drawings of Internally Triconnected Plane Graphs on O(n 2) Grids -- A Self-stabilizing and Local Delaunay Graph Construction -- Succinct Greedy Geometric Routing in the Euclidean Plane -- Electric Routing and Concurrent Flow Cutting -- A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths -- Strong Robustness of Randomized Rumor Spreading Protocols -- Data Structures for Range Median Queries -- Deletion without Rebalancing in Multiway Search Trees -- Counting in the Presence of Memory Faults -- A Simple, Fast, and Compact Static Dictionary -- Reconstructing Polygons from Scanner Data -- Computing Large Matchings in Planar Graphs with Fixed Minimum Degree -- Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs -- Covering a Graph with a Constrained Forest (Extended Abstract) -- Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs -- Upward Star-Shaped Polyhedral Graphs -- Conditional Hardness of Approximating Satisfiable Max 3CSP-q -- The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata (Extended Abstract) -- Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement -- Step-Assembly with a Constant Number of Tile Types -- Lower Bounds on Fast Searching -- Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity -- Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n 1?+?? ) Time -- PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k -- Optimal Randomized Algorithm for the Density Selection Problem -- New Results on Simple Stochastic Games -- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences -- Succinct Index for Dynamic Dictionary Matching -- Range Non-overlapping Indexing -- Querying Two Boundary Points for Shortest Paths in a Polygonal Domain -- Pattern Matching for 321-Avoiding Permutations -- Folding a Better Checkerboard -- Finding All Approximate Gapped Palindromes -- General Pseudo-random Generators from Weaker Models of Computation -- Random Generation and Enumeration of Bipartite Permutation Graphs -- A Combinatorial Algorithm for Horn Programs -- Online Maximum Directed Cut -- Maintaining Nets and Net Trees under Incremental Motion -- Distributed Scheduling of Parallel Hybrid Computations -- I/O-Efficient Contour Tree Simplification -- Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes -- I/O and Space-Efficient Path Traversal in Planar Graphs -- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model -- Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract) -- Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets -- On Partitioning a Graph into Two Connected Subgraphs. |
| Record Nr. | UNINA-9910484070703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 5th International Symposium, ISAAC '94, Beijing, P.R. China, August 25 - 27, 1994. Proceedings / / edited by Ding-Zhu Du, Xiang-Sun Zhang
| Algorithms and Computation [[electronic resource] ] : 5th International Symposium, ISAAC '94, Beijing, P.R. China, August 25 - 27, 1994. Proceedings / / edited by Ding-Zhu Du, Xiang-Sun Zhang |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XV, 693 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Data structures (Computer science) Algorithms Combinatorics Artificial intelligence Theory of Computation Computation by Abstract Devices Data Structures Algorithm Analysis and Problem Complexity Artificial Intelligence |
| ISBN | 3-540-48653-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Polynomial equations-solving and its applications -- Quasi-random combinatorial structures -- Hamiltonian abstract Voronoi diagrams in linear time -- Every set of disjoint line segments admits a binary tree -- The traveling cameraman problem, with applications to automatic optical inspection -- On determining the congruity of point sets in higher dimensions -- On random hard sets for NP -- Computing solutions uniquely collapses the polynomial hierarchy -- Verifying the determinant in parallel -- Hardness of approximating graph transformation problem -- Randomized wait-free naming -- Unifying themes for network selection -- Robust asynchronous algorithms in networks with a fault detection ring -- Distributed algorithms for finding small cycle covers in arbitrary networks -- A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming -- Analysis of the convergency of topology preserving neural networks on learning -- On helping and interactive proof systems -- Average time complexity of the SAT 1.2 algorithm -- Average cost to produce partial orders -- Two notes on low-density subset sum algorithm -- Rotation distance, triangulations of planar surfaces and hyperbolic geometry -- Finitely representable spatial objects and efficient computation -- Computing all small cuts in undirected networks -- Edge-coloring and f-coloring for various classes of graphs -- Edge-disjoint paths in permutation graphs -- Minimum augmentation to k-edge-connect specified vertices of a graph -- Algorithmic Chernoff-Hoeffding inequalities in integer programming -- Approximate pattern matching with samples -- An efficient optimal algorithm for minimizing the overall communication cost in replicated data management -- Multispace search: A new optimization approach -- Realizing degree sequences in parallel -- Efficient sequential and parallel algorithms for the negative cycle problem -- Fast and efficient operations on Parallel Priority Queues -- Heaps with bits -- Components and projections of curves over finite fields -- On the approximation of finding various minimal, maximal, and consistent sequences -- A linear-time algorithm for computing characteristic strings -- The maximum latency and identification of positive Boolean functions -- Fast deterministic Hot-Potato routing on processor arrays -- k-pairwise cluster fault tolerant routing in hypercubes -- On Steiner minimal trees in grid graphs and its application to VLSI routing -- Optimal routing of permutations on rings -- Resource bounded randomness and weakly complete problems -- Deterministic ? automata vis-a-vis deterministic Buchi automata -- Quantum computation and NP-complete problems -- Separability and one-way functions -- On the approximation of largest common subtrees and largest common point sets -- An approximation scheme for some Steiner tree problems in the plane -- A chain decomposition algorithm for the proof of a property on minimum weight triangulations -- Generating algorithm for quasi-full Steiner tree -- Analysing deletions in competitive self-adjusting linear list algorithms -- Are Fibonacci heaps optimal? -- Simple and efficient graph compression schemes for dense and complement graphs -- Improved algorithms for coloring random graphs -- On the parallel complexity of solving recurrence equations -- Extended graph connectivity and its gradually increasing parallel complexity -- Parallel h-v drawings of binary trees -- An efficient parallel strategy for recognizing series-parallel graphs -- Orthogonal queries in segments and triangles -- Further computational geometry in secondary memory -- Shortest safari routes in simple polygons -- On greedy tetrahedralization of points in 3D -- The totally-perfect bipartite graph and its construction -- k Best Cuts for Circular-Arc graphs -- Revisiting circular arc graphs -- Weighted irredundance of interval graphs -- A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs -- On the size of ordered binary decision diagrams representing threshold functions -- Nonuniform lowness and strong nonuniform lowness -- Definition and existence of super complexity cores -- Efficient algorithms for assigning chain-like tasks on a chain-like network computer -- Manpower scheduling with shift change constraints -- Fast algorithms for transversal matroid intersection problems -- A convex hull algorithm on coarse-grained multiprocessor -- A multiway merging network -- Reporting and counting intersections of lines within a polygon -- A new problem in string searching -- Achieving the shortest clock period by inserting the minimum amount of delay -- A randomized algorithm to Finite Automata Public Key Cryptosystem. |
| Record Nr. | UNISA-996466100903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Optimization and Applications [[electronic resource] ] : 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings / / edited by Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du
| Combinatorial Optimization and Applications [[electronic resource] ] : 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings / / edited by Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XIII, 810 p. 198 illus. in color.) |
| Disciplina | 519.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Computer Communication Networks Computer Graphics |
| ISBN | 3-319-26626-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466217603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||