Algorithm Theory -- SWAT 2014 [[electronic resource] ] : 14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings / / edited by Inge Li Gørtz, R. Ravi |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XX, 394 p. 39 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Data Science |
ISBN | 3-319-08404-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Online Makespan Minimization with Parallel Schedules -- Expected Linear Time Sorting for Word Size Ω(log2 n log log n) -- Amortized Analysis of Smooth Quadtrees in All Dimensions -- New Approximability Results for the Robust k-Median Problem -- Approximating the Revenue Maximization Problem with Sharp Demands -- Reconfiguring Independent Sets in Claw-Free Graphs -- Competitive Online Routing on Delaunay Triangulations -- Optimal Planar Orthogonal Skyline Counting Queries -- B-slack Trees: Space Efficient B-Trees -- Approximately Minwise Independence with Twisted Tabulation -- Colorful Bin Packing -- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques -- Win-Win Kernelization for Degree Sequence Completion Problems -- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem -- Covering Problems in Edge- and Node-Weighted Graphs -- Colored Range Searching in Linear Space -- Fast Dynamic Graph Algorithms for Parameterized Problems -- Extending Partial Representations of Proper and Unit Interval Graphs -- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams -- Approximate Counting of Matchings in (3,3)-Hypergraphs. |
Record Nr. | UNISA-996199994003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithm Theory -- SWAT 2014 : 14th Scandinavian Symposium and Workshops, SWAT 2014, Copenhagen, Denmark, July 2-4, 2014. Proceedings / / edited by Inge Li Gørtz, R. Ravi |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XX, 394 p. 39 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Data Science |
ISBN | 3-319-08404-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Online Makespan Minimization with Parallel Schedules -- Expected Linear Time Sorting for Word Size Ω(log2 n log log n) -- Amortized Analysis of Smooth Quadtrees in All Dimensions -- New Approximability Results for the Robust k-Median Problem -- Approximating the Revenue Maximization Problem with Sharp Demands -- Reconfiguring Independent Sets in Claw-Free Graphs -- Competitive Online Routing on Delaunay Triangulations -- Optimal Planar Orthogonal Skyline Counting Queries -- B-slack Trees: Space Efficient B-Trees -- Approximately Minwise Independence with Twisted Tabulation -- Colorful Bin Packing -- Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques -- Win-Win Kernelization for Degree Sequence Completion Problems -- On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem -- Covering Problems in Edge- and Node-Weighted Graphs -- Colored Range Searching in Linear Space -- Fast Dynamic Graph Algorithms for Parameterized Problems -- Extending Partial Representations of Proper and Unit Interval Graphs -- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams -- Approximate Counting of Matchings in (3,3)-Hypergraphs. |
Record Nr. | UNINA-9910484944503321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 438 p.) |
Disciplina | 005.73 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence—Data processing
Discrete mathematics Algorithms Computer networks Computer science—Mathematics Computer graphics Data Science Discrete Mathematics Computer Communication Networks Discrete Mathematics in Computer Science Computer Graphics |
ISBN | 3-540-69903-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation. |
Record Nr. | UNISA-996465379903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson |
Edizione | [1st ed. 2008.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
Descrizione fisica | 1 online resource (XIII, 438 p.) |
Disciplina | 005.73 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Artificial intelligence—Data processing
Discrete mathematics Algorithms Computer networks Computer science—Mathematics Computer graphics Data Science Discrete Mathematics Computer Communication Networks Discrete Mathematics in Computer Science Computer Graphics |
ISBN | 3-540-69903-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation. |
Record Nr. | UNINA-9910484732303321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
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 |
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 |
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 |
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 |
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 | ||
|
Algorithmic Aspects in Information and Management [[electronic resource] ] : 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings / / edited by Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XIV, 223 p. 36 illus.) |
Disciplina | 004.071 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Pattern recognition systems Computer networks Discrete Mathematics in Computer Science Data Science Automated Pattern Recognition Computer Communication Networks |
ISBN | 3-319-41168-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Item Pricing for Combinatorial Public Projects -- Norm-Based Locality Measures of Two-Dimensional Hilbert Curves -- On the Complexity of Clustering with Relaxed Size Constraints -- Superstring Graph: A New Approach for Genome Assembly -- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees -- A Very Fast String Matching Algorithm Based on Condensed Alphabets -- Minimum-Density Identifying Codes in Square Grids -- Separating Codes and Traffic Monitoring -- Know When to Persist: Deriving Value from a Stream Buffer -- Algorithmic Aspects of Upper Domination: A Parameterised Perspective -- On Network Formation Games with Heterogeneous Players and Basic Network Creation Games -- Parameterized Complexity of Team Formation in Social Networks -- Reconstructing Cactus Graphs from Shortest Path Information -- Near-Optimal Dominating Sets via Random Sampling -- A Multivariate Approach for Checking Resiliency in Access Control -- Efficient Algorithms for the Order Preserving Pattern Matching Problem -- Computing the Line-Constrained k-Center in the Plane for Small k -- Online k-max Search Algorithm with Applications to the Secretary Problem. |
Record Nr. | UNISA-996465958503316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithmic Aspects in Information and Management : 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings / / edited by Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (XIV, 223 p. 36 illus.) |
Disciplina | 004.071 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Pattern recognition systems Computer networks Discrete Mathematics in Computer Science Data Science Automated Pattern Recognition Computer Communication Networks |
ISBN | 3-319-41168-3 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Item Pricing for Combinatorial Public Projects -- Norm-Based Locality Measures of Two-Dimensional Hilbert Curves -- On the Complexity of Clustering with Relaxed Size Constraints -- Superstring Graph: A New Approach for Genome Assembly -- Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees -- A Very Fast String Matching Algorithm Based on Condensed Alphabets -- Minimum-Density Identifying Codes in Square Grids -- Separating Codes and Traffic Monitoring -- Know When to Persist: Deriving Value from a Stream Buffer -- Algorithmic Aspects of Upper Domination: A Parameterised Perspective -- On Network Formation Games with Heterogeneous Players and Basic Network Creation Games -- Parameterized Complexity of Team Formation in Social Networks -- Reconstructing Cactus Graphs from Shortest Path Information -- Near-Optimal Dominating Sets via Random Sampling -- A Multivariate Approach for Checking Resiliency in Access Control -- Efficient Algorithms for the Order Preserving Pattern Matching Problem -- Computing the Line-Constrained k-Center in the Plane for Small k -- Online k-max Search Algorithm with Applications to the Secretary Problem. |
Record Nr. | UNINA-9910484147203321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|