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.
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
| 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
| 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 | ||
| ||