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.
Combinatorial Algorithms [[electronic resource] ] : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings / / edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung
| Combinatorial Algorithms [[electronic resource] ] : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings / / edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIX, 388 p. 78 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Data protection Software engineering Image processing—Digital techniques Computer vision Data structures (Computer science) Information theory Discrete Mathematics in Computer Science Data and Information Security Software Engineering Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory |
| ISBN | 3-319-94667-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Some Recent New Directions in Multivariate Algorithmics -- Survey of some recent near polynomial time results for Parity Games -- Range Minimum Queries and Applications -- Collision-free Routing Problem with Restricted L-path -- Linear clique-width of bi-complement reducible graphs -- Linear Ramsey numbers -- Graphs that are Not Pairwise Compatible: A New Proof Technique Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families -- Minimum Polygons for Fixed Visibility VC-Dimension -- Minsum k-Sink Problem on Dynamic Flow Path Networks -- Fully leafed induced subtrees -- Pattern matching for k--track permutations -- Approximation algorithms for the p-hub center routing problem in parameterized metric graphs -- On the Area Requirements of Straight-Line Orthogonal Drawings of A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs -- Covering with Clubs: Complexity and Approximability -- On the Expected Number of Distinct Gapped Palindromic Factors -- Computational Complexity of Robot Arm Simulation Problems -- Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation -- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth -- An Optimal Algorithm for Online Prize-collecting Node-weighted Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem -- Structural Parameterizations for Colorful Components -- Analysis of Information Leakage due to Operative Errors in Card-based Protocols -- Zero-Suppression and Computation Models -- The Crossing Number of Seq-Shellable Drawings of Complete Graphs -- Cryptographic limitations on polynomial-time a posteriori query learning -- Placing Segments On Parallel Arcs -- Branch-and-bound algorithm for Symmetric Travelling Salesman Problem -- LZ-ABT: A Practical Algorithm for nalpha-Balanced Grammar Compression -- Faster Coreset Construction for Projective Clustering via Low-Rank Approximation -- Separating Interaction Effects Using Locating and Detecting Arrays -- An Efficient Representation of Partitions of Integers -- How far from a worst solution a random solution of a k-CSP instance can be?. |
| Record Nr. | UNISA-996465948603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorial Algorithms : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings / / edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung
| Combinatorial Algorithms : 29th International Workshop, IWOCA 2018, Singapore, July 16–19, 2018, Proceedings / / edited by Costas Iliopoulos, Hon Wai Leong, Wing-Kin Sung |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIX, 388 p. 78 illus.) |
| Disciplina | 511.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Data protection Software engineering Image processing—Digital techniques Computer vision Data structures (Computer science) Information theory Discrete Mathematics in Computer Science Data and Information Security Software Engineering Computer Imaging, Vision, Pattern Recognition and Graphics Data Structures and Information Theory |
| ISBN | 3-319-94667-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Some Recent New Directions in Multivariate Algorithmics -- Survey of some recent near polynomial time results for Parity Games -- Range Minimum Queries and Applications -- Collision-free Routing Problem with Restricted L-path -- Linear clique-width of bi-complement reducible graphs -- Linear Ramsey numbers -- Graphs that are Not Pairwise Compatible: A New Proof Technique Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families -- Minimum Polygons for Fixed Visibility VC-Dimension -- Minsum k-Sink Problem on Dynamic Flow Path Networks -- Fully leafed induced subtrees -- Pattern matching for k--track permutations -- Approximation algorithms for the p-hub center routing problem in parameterized metric graphs -- On the Area Requirements of Straight-Line Orthogonal Drawings of A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs -- Covering with Clubs: Complexity and Approximability -- On the Expected Number of Distinct Gapped Palindromic Factors -- Computational Complexity of Robot Arm Simulation Problems -- Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation -- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth -- An Optimal Algorithm for Online Prize-collecting Node-weighted Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem -- Structural Parameterizations for Colorful Components -- Analysis of Information Leakage due to Operative Errors in Card-based Protocols -- Zero-Suppression and Computation Models -- The Crossing Number of Seq-Shellable Drawings of Complete Graphs -- Cryptographic limitations on polynomial-time a posteriori query learning -- Placing Segments On Parallel Arcs -- Branch-and-bound algorithm for Symmetric Travelling Salesman Problem -- LZ-ABT: A Practical Algorithm for nalpha-Balanced Grammar Compression -- Faster Coreset Construction for Projective Clustering via Low-Rank Approximation -- Separating Interaction Effects Using Locating and Detecting Arrays -- An Efficient Representation of Partitions of Integers -- How far from a worst solution a random solution of a k-CSP instance can be?. |
| Record Nr. | UNINA-9910349427403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 2020 10th International Conference on Bioscience, Biochemistry and Bioinformatics / / Tatsuya Akutsu, Wing-Kin Sung, editors
| Proceedings of the 2020 10th International Conference on Bioscience, Biochemistry and Bioinformatics / / Tatsuya Akutsu, Wing-Kin Sung, editors |
| Pubbl/distr/stampa | New York, NY : , : Association for Computing Machinery, , 2020 |
| Descrizione fisica | 1 online resource (160 pages) |
| Disciplina | 610.28 |
| Collana | ACM Other Conferences |
| Soggetto topico |
Biomedical engineering
Imaging systems in medicine |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910412082703321 |
| New York, NY : , : Association for Computing Machinery, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Regulatory genomics [[electronic resource] ] : proceedings of the 3rd annual RECOMB workshop : National University of Singapore, Singapore 17-18 July 2006 / / editors, Leong Hon Wai, Sung Wing-Kin, Eleazar Eskin
| Regulatory genomics [[electronic resource] ] : proceedings of the 3rd annual RECOMB workshop : National University of Singapore, Singapore 17-18 July 2006 / / editors, Leong Hon Wai, Sung Wing-Kin, Eleazar Eskin |
| Pubbl/distr/stampa | London, : Imperial College Press, c2008 |
| Descrizione fisica | 1 online resource (144 p.) |
| Disciplina | 572.865 |
| Altri autori (Persone) |
EskinEleazar
LeongHon Wai <1955-> SungWing-Kin |
| Collana | Series on advances in bioinformatics and computational biology |
| Soggetto topico |
Genetic regulation
Genomics |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-84816-252-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Foreword; RECOMB Regulatory Genomics 2006 Organization; CONTENTS; Keynote Papers; Computational Prediction of Regulatory Elements by Comparative Sequence Analysis M. Tompa; A Tale of Two Topics - Motif Significance and Sensitivity of Spaced Seeds M. Li; Computational Challenges for Top-Down Modeling and Simulation of Biological Pathways S. Miyano; An Improved Gibbs Sampling Method for Motif Discovery via Sequence Weighting T. Jiang; Discovering Motifs with Transcription Factor Domain Knowledge F. Chin; Applications of ILP in Computational Biology A . Dress
On the Evolution of Transcription Regulation Networks R. Shamir Systems Pharmacology in Cancer Therapeutics: Iterative Informatics-Experimental Interface E. Liu; Computational Structural Proteomics and Inhibitor Discovery R. Abagyan; Characterization of Transcriptional Responses to Environmental Stress by Differential Location Analysis H. Tang; A Knowledge-based Hybrid Algorithm for Protein Secondary Structure Prediction W. L. Hsu; Monotony and Surprise (Conservative Approaches to Pattern Discovery) A . Apostolic0; Evolution of Bacterial Regulatory Systems M. S. Gelfand; Contributed Papers TScan: A Two-step De NOVO Motif Discovery Method 0. Abul, G. K. Sandve, and F. Drabbs1. Introduction; 2. Method; 2.1. Step 1; 2.2. Step 2; 2.2.1, Over-representation Conservation Scoring; 2.2.2. Frith et al. Scoring; 3. Experiments; 4. Conclusion; References; Redundancy Elimination in Motif Discovery Algorithms H. Leung and F. Chin; 1. Introduction; 2. Maximizing Likelihood; 3. The Motif Redundancy Problem; 3.1. The motif redundancy problem; 3.2. Formal definition; 4. Algorithm; 5. Experimental Results; 6. Concluding Remarks; Appendix; References GAMOT: An Efficient Genetic Algorithm for Finding Challenging Motifs in DNA Sequences N. Karaoglu, S. Maurer-Stroh, and B. Manderick1. Introduction; 2. GA for Motif Finding; 3. An Efficient Algorithm (GAMOT); 3.1. Fast motif discovery; 3.2. The genetic algorithm; 4. Experimental Results; 4.1. Comparison with exhaustive search; 4.2. Comparison with GAI and GA2; 4.3. Comparison with other algorithms; 4.3.1. Quality of the solutions; 4.4. GAMOTparameters; 5. Conclusions and Future Work; References; Identification of Spaced Regulatory Sites via Submotif Modeling E. Wijaya and R. Kanagasabai 1. Introduction 2. Related Work; 3. Our Approach; 4. Problem Definition; 5. Algorithm SPACE; 5.1. Generation of candidate motifs; 5.2. Constrained frequent pattern mining; 5.2.1. Generalized gap; 5.2.2. Mining of constrained frequent patterns; 5.3. Significance testing and scoring; 6. Experimental Results; 6.1. Results on Tompa's benchmark data set; 6.2. Results on synthetic data set; 7. Discussion and Conclusions; References; Refining Motif Finders with E-value Calculations N. Nagarajan, P. Ng, and U. Keich; 1. Introduction; 2. Efficiently Computing E-values 3. Optimizing for E-values - Conspv |
| Record Nr. | UNINA-9910455059103321 |
| London, : Imperial College Press, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Regulatory genomics [[electronic resource] ] : proceedings of the 3rd annual RECOMB workshop : National University of Singapore, Singapore 17-18 July 2006 / / editors, Leong Hon Wai, Sung Wing-Kin, Eleazar Eskin
| Regulatory genomics [[electronic resource] ] : proceedings of the 3rd annual RECOMB workshop : National University of Singapore, Singapore 17-18 July 2006 / / editors, Leong Hon Wai, Sung Wing-Kin, Eleazar Eskin |
| Pubbl/distr/stampa | London, : Imperial College Press, c2008 |
| Descrizione fisica | 1 online resource (144 p.) |
| Disciplina | 572.865 |
| Altri autori (Persone) |
EskinEleazar
LeongHon Wai <1955-> SungWing-Kin |
| Collana | Series on advances in bioinformatics and computational biology |
| Soggetto topico |
Genetic regulation
Genomics |
| ISBN | 1-84816-252-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Foreword; RECOMB Regulatory Genomics 2006 Organization; CONTENTS; Keynote Papers; Computational Prediction of Regulatory Elements by Comparative Sequence Analysis M. Tompa; A Tale of Two Topics - Motif Significance and Sensitivity of Spaced Seeds M. Li; Computational Challenges for Top-Down Modeling and Simulation of Biological Pathways S. Miyano; An Improved Gibbs Sampling Method for Motif Discovery via Sequence Weighting T. Jiang; Discovering Motifs with Transcription Factor Domain Knowledge F. Chin; Applications of ILP in Computational Biology A . Dress
On the Evolution of Transcription Regulation Networks R. Shamir Systems Pharmacology in Cancer Therapeutics: Iterative Informatics-Experimental Interface E. Liu; Computational Structural Proteomics and Inhibitor Discovery R. Abagyan; Characterization of Transcriptional Responses to Environmental Stress by Differential Location Analysis H. Tang; A Knowledge-based Hybrid Algorithm for Protein Secondary Structure Prediction W. L. Hsu; Monotony and Surprise (Conservative Approaches to Pattern Discovery) A . Apostolic0; Evolution of Bacterial Regulatory Systems M. S. Gelfand; Contributed Papers TScan: A Two-step De NOVO Motif Discovery Method 0. Abul, G. K. Sandve, and F. Drabbs1. Introduction; 2. Method; 2.1. Step 1; 2.2. Step 2; 2.2.1, Over-representation Conservation Scoring; 2.2.2. Frith et al. Scoring; 3. Experiments; 4. Conclusion; References; Redundancy Elimination in Motif Discovery Algorithms H. Leung and F. Chin; 1. Introduction; 2. Maximizing Likelihood; 3. The Motif Redundancy Problem; 3.1. The motif redundancy problem; 3.2. Formal definition; 4. Algorithm; 5. Experimental Results; 6. Concluding Remarks; Appendix; References GAMOT: An Efficient Genetic Algorithm for Finding Challenging Motifs in DNA Sequences N. Karaoglu, S. Maurer-Stroh, and B. Manderick1. Introduction; 2. GA for Motif Finding; 3. An Efficient Algorithm (GAMOT); 3.1. Fast motif discovery; 3.2. The genetic algorithm; 4. Experimental Results; 4.1. Comparison with exhaustive search; 4.2. Comparison with GAI and GA2; 4.3. Comparison with other algorithms; 4.3.1. Quality of the solutions; 4.4. GAMOTparameters; 5. Conclusions and Future Work; References; Identification of Spaced Regulatory Sites via Submotif Modeling E. Wijaya and R. Kanagasabai 1. Introduction 2. Related Work; 3. Our Approach; 4. Problem Definition; 5. Algorithm SPACE; 5.1. Generation of candidate motifs; 5.2. Constrained frequent pattern mining; 5.2.1. Generalized gap; 5.2.2. Mining of constrained frequent patterns; 5.3. Significance testing and scoring; 6. Experimental Results; 6.1. Results on Tompa's benchmark data set; 6.2. Results on synthetic data set; 7. Discussion and Conclusions; References; Refining Motif Finders with E-value Calculations N. Nagarajan, P. Ng, and U. Keich; 1. Introduction; 2. Efficiently Computing E-values 3. Optimizing for E-values - Conspv |
| Record Nr. | UNINA-9910777933003321 |
| London, : Imperial College Press, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Regulatory genomics : proceedings of the 3rd annual RECOMB workshop : National University of Singapore, Singapore 17-18 July 2006 / / editors, Leong Hon Wai, Sung Wing-Kin, Eleazar Eskin
| Regulatory genomics : proceedings of the 3rd annual RECOMB workshop : National University of Singapore, Singapore 17-18 July 2006 / / editors, Leong Hon Wai, Sung Wing-Kin, Eleazar Eskin |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | London, : Imperial College Press, c2008 |
| Descrizione fisica | 1 online resource (144 p.) |
| Disciplina | 572.865 |
| Altri autori (Persone) |
EskinEleazar
LeongHon Wai <1955-> SungWing-Kin |
| Collana | Series on advances in bioinformatics and computational biology |
| Soggetto topico |
Genetic regulation
Genomics |
| ISBN | 1-84816-252-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Foreword; RECOMB Regulatory Genomics 2006 Organization; CONTENTS; Keynote Papers; Computational Prediction of Regulatory Elements by Comparative Sequence Analysis M. Tompa; A Tale of Two Topics - Motif Significance and Sensitivity of Spaced Seeds M. Li; Computational Challenges for Top-Down Modeling and Simulation of Biological Pathways S. Miyano; An Improved Gibbs Sampling Method for Motif Discovery via Sequence Weighting T. Jiang; Discovering Motifs with Transcription Factor Domain Knowledge F. Chin; Applications of ILP in Computational Biology A . Dress
On the Evolution of Transcription Regulation Networks R. Shamir Systems Pharmacology in Cancer Therapeutics: Iterative Informatics-Experimental Interface E. Liu; Computational Structural Proteomics and Inhibitor Discovery R. Abagyan; Characterization of Transcriptional Responses to Environmental Stress by Differential Location Analysis H. Tang; A Knowledge-based Hybrid Algorithm for Protein Secondary Structure Prediction W. L. Hsu; Monotony and Surprise (Conservative Approaches to Pattern Discovery) A . Apostolic0; Evolution of Bacterial Regulatory Systems M. S. Gelfand; Contributed Papers TScan: A Two-step De NOVO Motif Discovery Method 0. Abul, G. K. Sandve, and F. Drabbs1. Introduction; 2. Method; 2.1. Step 1; 2.2. Step 2; 2.2.1, Over-representation Conservation Scoring; 2.2.2. Frith et al. Scoring; 3. Experiments; 4. Conclusion; References; Redundancy Elimination in Motif Discovery Algorithms H. Leung and F. Chin; 1. Introduction; 2. Maximizing Likelihood; 3. The Motif Redundancy Problem; 3.1. The motif redundancy problem; 3.2. Formal definition; 4. Algorithm; 5. Experimental Results; 6. Concluding Remarks; Appendix; References GAMOT: An Efficient Genetic Algorithm for Finding Challenging Motifs in DNA Sequences N. Karaoglu, S. Maurer-Stroh, and B. Manderick1. Introduction; 2. GA for Motif Finding; 3. An Efficient Algorithm (GAMOT); 3.1. Fast motif discovery; 3.2. The genetic algorithm; 4. Experimental Results; 4.1. Comparison with exhaustive search; 4.2. Comparison with GAI and GA2; 4.3. Comparison with other algorithms; 4.3.1. Quality of the solutions; 4.4. GAMOTparameters; 5. Conclusions and Future Work; References; Identification of Spaced Regulatory Sites via Submotif Modeling E. Wijaya and R. Kanagasabai 1. Introduction 2. Related Work; 3. Our Approach; 4. Problem Definition; 5. Algorithm SPACE; 5.1. Generation of candidate motifs; 5.2. Constrained frequent pattern mining; 5.2.1. Generalized gap; 5.2.2. Mining of constrained frequent patterns; 5.3. Significance testing and scoring; 6. Experimental Results; 6.1. Results on Tompa's benchmark data set; 6.2. Results on synthetic data set; 7. Discussion and Conclusions; References; Refining Motif Finders with E-value Calculations N. Nagarajan, P. Ng, and U. Keich; 1. Introduction; 2. Efficiently Computing E-values 3. Optimizing for E-values - Conspv |
| Record Nr. | UNINA-9910822091103321 |
| London, : Imperial College Press, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
WALCOM: Algorithms and Computation [[electronic resource] ] : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings / / edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung
| WALCOM: Algorithms and Computation [[electronic resource] ] : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings / / edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XIII, 350 p. 140 illus., 55 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Data structures (Computer science) Information theory Computer science - Mathematics Artificial intelligence Data Structures and Information Theory Mathematics of Computing Artificial Intelligence |
| ISBN | 3-030-39881-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Drawing Planar Graphs -- Space Efficient Separator Algorithms for Planar Graphs -- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks -- Optimum Algorithm for the Mutual Visibility Problem -- Routing in Histograms -- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips -- Shortest Covers of All Cyclic Shifts of a String -- Packing Trees into 1-planar Graphs -- Angle Covers: Algorithms and Complexity -- Fast Multiple Pattern Cartesian Tree Matching -- Generalized Dictionary Matching under Substring Consistent Equivalence Relations -- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons -- Maximum Bipartite Subgraph of Geometric Intersection Graphs -- The Stub Resolution of 1-planar Graphs -- Dispersion of Mobile Robots on Grids -- Packing and Covering with Segments -- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration -- Partitioning a graph into complementary subgraphs -- On the Maximum Edge-Pair Embedding Bipartite Matching -- Packing Arc-Disjoint Cycles in Bipartite Tournaments -- Matching random colored points with rectangles -- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams -- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs -- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs -- Faster Privacy-Preserving Computation of Edit Distance with Moves -- Parameterized Algorithms for the Happy Set Problem -- An Experimental Study of a 1-planarity Testing and Embedding Algorithm -- Trichotomy for the recon guration problem of integer linear systems -- Train Scheduling: Hardness and Algorithms. |
| Record Nr. | UNISA-996418205403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings / / edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung
| WALCOM: Algorithms and Computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings / / edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XIII, 350 p. 140 illus., 55 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Data structures (Computer science) Information theory Computer science - Mathematics Artificial intelligence Data Structures and Information Theory Mathematics of Computing Artificial Intelligence |
| ISBN | 3-030-39881-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Drawing Planar Graphs -- Space Efficient Separator Algorithms for Planar Graphs -- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks -- Optimum Algorithm for the Mutual Visibility Problem -- Routing in Histograms -- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips -- Shortest Covers of All Cyclic Shifts of a String -- Packing Trees into 1-planar Graphs -- Angle Covers: Algorithms and Complexity -- Fast Multiple Pattern Cartesian Tree Matching -- Generalized Dictionary Matching under Substring Consistent Equivalence Relations -- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons -- Maximum Bipartite Subgraph of Geometric Intersection Graphs -- The Stub Resolution of 1-planar Graphs -- Dispersion of Mobile Robots on Grids -- Packing and Covering with Segments -- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration -- Partitioning a graph into complementary subgraphs -- On the Maximum Edge-Pair Embedding Bipartite Matching -- Packing Arc-Disjoint Cycles in Bipartite Tournaments -- Matching random colored points with rectangles -- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams -- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs -- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs -- Faster Privacy-Preserving Computation of Edit Distance with Moves -- Parameterized Algorithms for the Happy Set Problem -- An Experimental Study of a 1-planarity Testing and Embedding Algorithm -- Trichotomy for the recon guration problem of integer linear systems -- Train Scheduling: Hardness and Algorithms. |
| Record Nr. | UNINA-9910373927803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
WALCOM: Algorithms and Computation [[electronic resource] ] : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings / / edited by M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
| WALCOM: Algorithms and Computation [[electronic resource] ] : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings / / edited by M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XX, 265 p. 37 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Mathematical statistics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Probability and Statistics in Computer Science Data Science |
| ISBN | 3-319-75172-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465303703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings / / edited by M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
| WALCOM: Algorithms and Computation : 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings / / edited by M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XX, 265 p. 37 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Mathematical statistics Artificial intelligence—Data processing Discrete Mathematics in Computer Science Numerical Analysis Probability and Statistics in Computer Science Data Science |
| ISBN | 3-319-75172-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910349460303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||