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.
Theoretical Computer Science and Discrete Mathematics : First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers / / edited by S. Arumugam, Jay Bagga, Lowell W. Beineke, B.S. Panda
| Theoretical Computer Science and Discrete Mathematics : First International Conference, ICTCSDM 2016, Krishnankoil, India, December 19-21, 2016, Revised Selected Papers / / edited by S. Arumugam, Jay Bagga, Lowell W. Beineke, B.S. Panda |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XIII, 458 p. 122 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Image processing—Digital techniques Computer vision Data protection Artificial intelligence Discrete Mathematics in Computer Science Data Science Computer Imaging, Vision, Pattern Recognition and Graphics Data and Information Security Artificial Intelligence |
| ISBN | 3-319-64419-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Degree Associated Reconstruction Number of Biregular Bipartite Graphs Whose Degrees Differ by at Least Two -- 1 Introduction -- 2 Drn of Biregular Bipartite Graphs -- References -- 1-Normal DRA for Insertion Languages -- 1 Introduction -- 2 Preliminaries -- 2.1 Restarting Automaton with Delete Operation (DRA) -- 2.2 Insertion Grammars -- 3 1-Normal DRA -- 4 1-Normal DRA and Insertion Grammar -- 5 The Power of 1-Normal DRA -- 6 Conclusion -- References -- Formal Language Representation and Modelling Structures Underlying RNA Folding Process -- 1 Introduction -- 2 Preliminaries -- 2.1 Matrix Insertion-Deletion Systems -- 3 Modelling Bio-Molecular Structures -- 4 Conclusion -- References -- Homometric Number of a Graph and Some Related Concepts -- 1 Introduction -- 1.1 Basic Definitions and Preliminaries -- 2 Homometric Number -- 3 Regular Graphs -- 4 Some Related Graph Parameters -- References -- Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2 -- 1 Introduction -- 2 Forbidden Induced Subgraphs of ATE - Free Bigraphs of Ferrers Dimension 2 -- References -- Global Secure Domination in Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- A Novel Reversible Data Hiding Method in Teleradiology to Maximize Data Capacity in Medical Images -- 1 Introduction -- 2 Proposed Method -- 2.1 Image Encryption -- 2.2 Pre-processing and Location Map -- 2.3 Duplicating Pixel Values -- 2.4 Data Embedding, Extracting and Recovery -- 3 Experimental Results -- 3.1 6-Rounds Duplicating for Improving Data Capacity -- 3.2 File Size -- 3.3 Reversibility -- 4 Conclusion -- References -- Indicated Coloring of Cartesian Product of Graphs -- 1 Introduction -- 2 Indicated Coloring on Cartesian Product of Graphs -- References.
A Bi-level Security Mechanism for Efficient Protection on Graphs in Online Social Network -- 1 Introduction -- 2 Privacy Requirements of Big Data -- 3 Existing Mechanisms for Data Privacy and Graph Protection -- 4 Cosine Similarity with P-Stability -- 5 Performance Evaluation -- 6 Conclusion -- References -- On Nearly Distance Magic Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- Evenly Partite Directed Bigraph Factorization of Wreath Product of Graphs -- 1 Introduction -- 2 Evenly Partite Directed Bigraph Factorization of (CmKn)* -- 3 Evenly Partite Directed Bigraph Factorization of (KmKn)* -- 4 Conclusion -- References -- Minimum Layout of Circulant Graphs into Certain Height Balanced Trees -- 1 Introduction -- 2 Main Results -- 3 Conclusion -- References -- Dissecting Power of Certain Matrix Languages -- 1 Introduction -- 2 Preliminaries -- 3 Dissecting Matrix Languages -- 4 Conclusion -- References -- Degree Associated Reconstruction Number of Split Graphs with Regular Independent Set -- 1 Introduction -- 2 Drn of Split Graphs -- 3 Conclusion -- References -- Distance Antimagic Labelings of Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- Probabilistic Conjunctive Grammar -- 1 Introduction -- 2 Context-Free Grammar (CFG) and Probabilistic Context-Free Grammar (PCFG) -- 3 Conjunctive Grammar (CG) and Probabilistic Conjunctive Grammar (PCG) -- 3.1 Binary Normal Form of PCG -- 4 Conclusion -- References -- (1, 2)-Domination in Graphs -- 1 Introduction -- 2 Bounds of 1, 2 in terms of -- 3 Composition of Two Graphs -- 4 Some Characterizations -- 5 Trees -- References -- New Construction on SD-Prime Cordial Labeling -- 1 Introduction -- 2 Main Results -- References -- Dominator Coloring of Generalized Petersen Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion. References -- Super Edge-Antimagic Gracefulness of Disconnected Graphs -- 1 Introduction -- 2 Main Results -- References -- Mixed Noise Elimination and Data Hiding for Secure Data Transmission -- 1 Introduction -- 2 Module Description -- 2.1 Pre-processing -- 2.2 Filtering -- 2.3 Denoising -- 2.4 Transmitter Side -- 2.5 Receiver Side -- 3 Proposed System Process Flow Diagram -- 3.1 Results and Discussion -- 4 Conclusion -- References -- Analysis of Particle Swarm Optimization Based 2D FIR Filter for Reduction of Additive and Multiplicative Noise in Images -- 1 Introduction -- 2 Previous Works -- 3 Two Dimensional FIR Filter -- 4 Median Filter -- 5 Additive and Multiplicative Noise in Images -- 5.1 Additive Noise -- 5.2 Multiplicative Noise -- 6 Particle Swarm Optimization -- 7 Design Formulation -- 8 Results and Discussion -- 9 Conclusion -- References -- Irregularity Strength of Corona of Two Graphs -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- 1-Distant Irregularity Strength of Graphs -- 1 Introduction -- 2 1-Distant Irregularity Strength of Certain Families of Graphs -- 3 Conclusion and Scope -- References -- Cloud Data Security Based on Data Partitions and Multiple Encryptions -- 1 Introduction -- 2 Proposed Scheme -- 2.1 Algorithm for Encryption -- 2.2 Algorithm for Decryption -- 3 Implementation and Testing -- 4 Conclusion -- 5 Future Work -- References -- Upper Majority Domination Number of a Graph -- 1 Introduction -- 2 Upper Majority Domination -- 3 Conclusion and Scope -- References -- Super (a, 3)-edge Antimagic Total Labeling for Union of Two Stars -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph -- 1 Introduction -- 2 Laplacian Matrix and Signless Laplacian Matrix. 3 Determinant of Laplacian Matrix and Signless Laplacian Matrix -- 4 Conclusion -- References -- On the Complexity of Minimum Cardinality Maximal Uniquely Restricted Matching in Graphs -- 1 Introduction -- 2 Preliminaries -- 3 NP-completeness Results -- 4 Hardness of Approximating Min-UR-Matching -- 5 Chain Graphs -- 6 Conclusion -- References -- Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Partial Grundy Coloring in Perfect Elimination Bipartite Graph -- 4 Grundy Coloring in Chain Graph -- 5 Partial Grundy Coloring in Subclasses of Chordal Graphs -- 6 Conclusion -- References -- On Prime Distance Labeling of Graphs -- 1 Introduction -- 2 Main Results -- References -- Dominator Colorings of Products of Graphs -- 1 Introduction -- 2 Dominator Chromatic Number of the Tensor Product of Graphs -- 3 Dominator Chromatic Number of the Cartesian Product of Graphs -- 4 Conclusion -- References -- Efficient Hybrid Approach for Compression of Multi Modal Medical Images -- 1 Introduction -- 2 Related Works -- 3 Methodologies for Medical Image Compression -- 3.1 Fractal Algorithm -- 3.2 Radial Basis Function Neural Network (RBFNN) for Image Compression -- 3.3 Hybrid Image Compression -- 4 Performance Parameters -- 5 Results -- 5.1 Compression Ratio -- 5.2 PSNR -- 5.3 Memory -- 6 Conclusion and Future Work -- References -- The Median Problem on Symmetric Bipartite Graphs -- 1 Introduction -- 2 Median Problem on Symmetric Bipartite Graphs -- 3 Bipartite Graph of a Graph -- 4 The Median Problem on Square of Bipartite Graphs -- References -- Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions -- 1 Introduction -- 1.1 Basic Definitions -- 2 Unique Membership and Unique Non Membership Transitions. 3 Complete Intuitionistic Fuzzy Automaton with Unique Membership and Unique Nonmembership Transitions -- 4 Conclusion -- References -- Independent 2-Point Set Domination in Graphs -- 1 Introduction -- 2 Basic Results -- 3 Some Classes of i-2psd Graphs -- 4 Conclusion -- References -- On Graphs Whose Graphoidal Length Is Half of Its Size -- 1 Introduction -- 1.1 Terminology and Notation -- 2 Graphs with Graphoidal Length "4262304 q/2"5263305 -- 3 Characterization of Graphs in F* -- 4 Conclusion -- References -- Point-Set Domination in Graphs. VIII: Perfect and Efficient PSD Sets -- 1 Introduction -- 2 Perfect and Efficient Psd-Sets -- 3 Conclusion and Scope -- References -- Graphoidal Length and Graphoidal Covering Number of a Graph -- 1 Introduction -- 2 Main Results -- 3 Conclusion and Scope -- References -- An Overview of the MapReduce Model -- 1 Introduction -- 2 Implementation Scrutiny -- 2.1 Categorization -- 2.2 Feature Selection -- 2.3 C5.0 Classifier -- 3 Conclusion -- References -- Identification of Salinity Stress Tolerant Proteins in Sorghum Bicolor Computational Approach -- 1 Introduction -- 2 Materials and Methods -- 2.1 String Database -- 2.2 Cytoscape -- 2.3 Topological Analysis -- 2.4 Functional Enrichment Analysis -- 3 Results -- 4 Discussion -- 5 Conclusion -- References -- On Total Roman Domination in Graphs -- 1 Introduction -- 2 Bounds on Total Roman Domination Number -- 3 Bounds in Terms of Girth -- References -- Restrained Differential of a Graph -- 1 Introduction -- 2 Notations -- 3 Restrained Differential Values of Some Standard Graphs -- 4 Bounds on (G) -- References -- The Distinguishing Number of Kronecker Product of Two Graphs -- 1 Introduction -- 2 Main Results -- References -- Grammar Systems Based on Equal Matrix Rules and Alphabetic Flat Splicing -- 1 Introduction -- 2 Preliminaries. 3 Alphabetic Flat Splicing Equal Matrix Grammar Systems. |
| Record Nr. | UNINA-9910484738903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings / / edited by Jianer Chen, Qilong Feng, Jinhui Xu
| Theory and Applications of Models of Computation [[electronic resource] ] : 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings / / edited by Jianer Chen, Qilong Feng, Jinhui Xu |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XI, 454 p. 240 illus., 33 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science - Mathematics Discrete mathematics Artificial intelligence - Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-030-59267-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Semilattices of punctual numberings -- Partial Sums on the Ultra-Wide Word RAM -- Securely Computing the $n$-Variable Equality Function with $2n$ Cards 24 -- Polynomial Kernels for Paw-free Edge Modi cation Problems -- Floorplans with Walls -- A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-Cover Problem -- Sumcheck-Based Delegation of Quantum Computing to Rational Server -- Online Removable Knapsack Problems for Integer-Sized Items -- An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem -- LP-based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors -- A Constant Factor Approximation for Lower-Bounded $k$-Median -- Reverse Mathematics, Projective Modules and Invertible Modules -- Two-Stage Submodular Maximization Problem Beyond Non-Negative and Monotone -- Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications -- On the complexity of acyclic modules in automata networks.-Eternal Connected Vertex Cover Problem -- Parametric Streaming Two-Stage Submodular Maximization -- Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint -- A Novel Initialization Algorithm for Fuzzy C-means Problems -- On the Parameterized Complexity of $d$-Restricted Boolean Net Synthesis -- Approximate #Knapsack Computations to Count Semi-Fair Allocations -- Characterizations and approximability of hard counting classes below #P -- On Existence of Equilibrium Under Social Coalition Structures -- Space Complexity of Streaming Algorithms on Universal Quantum Computers -- On Coresets for Support Vector Machines -- Tractabilities for Tree Assembly Problems -- On Characterization of Petrie Partitionable Plane Graphs -- Disjunctive Propositional Logic and Scott Domains -- Dispersing and Grouping Points on Segments in the Plane -- Synchronizing Words and Monoid Factorization: A Parameterized Perspective -- Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Perspective -- A Primal-Dual Algorithm for Euclidean $k$-Means problem with Penalties -- The Complexity of the Partition Coloring Problem -- FPT Algorithms for Generalized Feedback Vertex Set Problems -- Fixed-order Book Thickness with Respect to Vertex-cover Number: New Observations and Further Analysis -- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles -- On Pure Space vs Catalytic Space. |
| Record Nr. | UNISA-996418311503316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation : 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings / / edited by Jianer Chen, Qilong Feng, Jinhui Xu
| Theory and Applications of Models of Computation : 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings / / edited by Jianer Chen, Qilong Feng, Jinhui Xu |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (XI, 454 p. 240 illus., 33 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science - Mathematics Discrete mathematics Artificial intelligence - Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-030-59267-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Semilattices of punctual numberings -- Partial Sums on the Ultra-Wide Word RAM -- Securely Computing the $n$-Variable Equality Function with $2n$ Cards 24 -- Polynomial Kernels for Paw-free Edge Modi cation Problems -- Floorplans with Walls -- A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-Cover Problem -- Sumcheck-Based Delegation of Quantum Computing to Rational Server -- Online Removable Knapsack Problems for Integer-Sized Items -- An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem -- LP-based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors -- A Constant Factor Approximation for Lower-Bounded $k$-Median -- Reverse Mathematics, Projective Modules and Invertible Modules -- Two-Stage Submodular Maximization Problem Beyond Non-Negative and Monotone -- Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications -- On the complexity of acyclic modules in automata networks.-Eternal Connected Vertex Cover Problem -- Parametric Streaming Two-Stage Submodular Maximization -- Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint -- A Novel Initialization Algorithm for Fuzzy C-means Problems -- On the Parameterized Complexity of $d$-Restricted Boolean Net Synthesis -- Approximate #Knapsack Computations to Count Semi-Fair Allocations -- Characterizations and approximability of hard counting classes below #P -- On Existence of Equilibrium Under Social Coalition Structures -- Space Complexity of Streaming Algorithms on Universal Quantum Computers -- On Coresets for Support Vector Machines -- Tractabilities for Tree Assembly Problems -- On Characterization of Petrie Partitionable Plane Graphs -- Disjunctive Propositional Logic and Scott Domains -- Dispersing and Grouping Points on Segments in the Plane -- Synchronizing Words and Monoid Factorization: A Parameterized Perspective -- Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Perspective -- A Primal-Dual Algorithm for Euclidean $k$-Means problem with Penalties -- The Complexity of the Partition Coloring Problem -- FPT Algorithms for Generalized Feedback Vertex Set Problems -- Fixed-order Book Thickness with Respect to Vertex-cover Number: New Observations and Further Analysis -- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles -- On Pure Space vs Catalytic Space. |
| Record Nr. | UNINA-9910427705103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Models of Computation [[electronic resource] ] : 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings / / edited by T.V. Gopal, Junzo Watada
| Theory and Applications of Models of Computation [[electronic resource] ] : 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings / / edited by T.V. Gopal, Junzo Watada |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIV, 708 p. 729 illus., 77 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Machine theory Computer science - Mathematics Discrete mathematics Numerical analysis Artificial intelligence - Data processing Formal Languages and Automata Theory Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-030-14812-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Battery Scheduling Problem -- The Volume of a Crosspolytope Truncated by a Halfspace -- Computable Isomorphisms of Distributive Lattices -- Minmax-Regret Evacuation Planning in Cycle Networks -- Planar digraphs for automatic complexity -- Approximation Algorithms for Graph Burning -- Sublinear decoding schemes for non-adaptive group testing with inhibitors -- Compacting and Grouping Mobile Agents on Dynamic Rings -- Maximum Independent and Disjoint Coverage -- Algorithms for closed and farthest string problems via rank distance -- Computable Analysis of Linear Rearrangement Optimization -- On the power of oritatami cotranscriptional folding with unary bead sequence -- Stochastic Programming for Energy Plant Operation -- Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts -- Unshuffling permutations: Trivial bijections and compositions -- Continuous Team Semantics -- Exact Satisfiability with Jokers -- Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators -- On the Complexity of and Algorithms for Min-Max Target Coverage on a Line Boundary -- Online Travelling Salesman Problem on a Circle -- Second-order linear-time computability with applications to computable analysis -- Consistency as a Branching Time Notion -- Finite choice, convex choice and sorting -- The number of languages with maximum state complexity -- Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank -- GPU based Horn-Schunck Method to Estimate Optical Flow and Occlusion -- Robot Computing for Music Visualization -- Combinatorial Properties of Fibonacci Arrays -- Watson-Crick Jumping Finite Automata -- Dispersion of Mobile Robots: The Power of Randomness -- Building Resource Auto-Scaler with Functional-Link Neural Network and Adaptive Bacterial Foraging Optimization -- On the Enumeration of Bicriteria Temporal Paths -- An output-sensitive algorithm for the minimization of 2-dimensional String Covers -- Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection -- Card-based Cryptography with Invisible Ink -- Read-once certificates of linear infeasibility in UTVPI constraints -- Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function -- The Complexity of Synthesis for 43 Boolean Petri Net Types -- Space Lower Bounds for Graph Stream Problems -- Bounded jump and the high/low hierarchy -- Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P -- Dynamic Average Value-at-Risk Allocation on Worst Scenarios in Asset Management -- First-Order vs. Second-Order Encodings for LTLf-to-Automata Translation. |
| Record Nr. | UNISA-996466321403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation : 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings / / edited by T.V. Gopal, Junzo Watada
| Theory and Applications of Models of Computation : 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings / / edited by T.V. Gopal, Junzo Watada |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XIV, 708 p. 729 illus., 77 illus. in color.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Machine theory Computer science - Mathematics Discrete mathematics Numerical analysis Artificial intelligence - Data processing Formal Languages and Automata Theory Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-030-14812-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Battery Scheduling Problem -- The Volume of a Crosspolytope Truncated by a Halfspace -- Computable Isomorphisms of Distributive Lattices -- Minmax-Regret Evacuation Planning in Cycle Networks -- Planar digraphs for automatic complexity -- Approximation Algorithms for Graph Burning -- Sublinear decoding schemes for non-adaptive group testing with inhibitors -- Compacting and Grouping Mobile Agents on Dynamic Rings -- Maximum Independent and Disjoint Coverage -- Algorithms for closed and farthest string problems via rank distance -- Computable Analysis of Linear Rearrangement Optimization -- On the power of oritatami cotranscriptional folding with unary bead sequence -- Stochastic Programming for Energy Plant Operation -- Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts -- Unshuffling permutations: Trivial bijections and compositions -- Continuous Team Semantics -- Exact Satisfiability with Jokers -- Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators -- On the Complexity of and Algorithms for Min-Max Target Coverage on a Line Boundary -- Online Travelling Salesman Problem on a Circle -- Second-order linear-time computability with applications to computable analysis -- Consistency as a Branching Time Notion -- Finite choice, convex choice and sorting -- The number of languages with maximum state complexity -- Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank -- GPU based Horn-Schunck Method to Estimate Optical Flow and Occlusion -- Robot Computing for Music Visualization -- Combinatorial Properties of Fibonacci Arrays -- Watson-Crick Jumping Finite Automata -- Dispersion of Mobile Robots: The Power of Randomness -- Building Resource Auto-Scaler with Functional-Link Neural Network and Adaptive Bacterial Foraging Optimization -- On the Enumeration of Bicriteria Temporal Paths -- An output-sensitive algorithm for the minimization of 2-dimensional String Covers -- Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection -- Card-based Cryptography with Invisible Ink -- Read-once certificates of linear infeasibility in UTVPI constraints -- Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function -- The Complexity of Synthesis for 43 Boolean Petri Net Types -- Space Lower Bounds for Graph Stream Problems -- Bounded jump and the high/low hierarchy -- Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P -- Dynamic Average Value-at-Risk Allocation on Worst Scenarios in Asset Management -- First-Order vs. Second-Order Encodings for LTLf-to-Automata Translation. |
| Record Nr. | UNINA-9910337859403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Satisfiability Testing – SAT 2018 [[electronic resource] ] : 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings / / edited by Olaf Beyersdorff, Christoph M. Wintersteiger
| Theory and Applications of Satisfiability Testing – SAT 2018 [[electronic resource] ] : 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings / / edited by Olaf Beyersdorff, Christoph M. Wintersteiger |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIX, 452 p. 73 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Software engineering Computer programming Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Theory of Computation Artificial Intelligence Software Engineering Programming Techniques Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-319-94144-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465694803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Satisfiability Testing – SAT 2018 : 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings / / edited by Olaf Beyersdorff, Christoph M. Wintersteiger
| Theory and Applications of Satisfiability Testing – SAT 2018 : 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018, Proceedings / / edited by Olaf Beyersdorff, Christoph M. Wintersteiger |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIX, 452 p. 73 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Software engineering Computer programming Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Theory of Computation Artificial Intelligence Software Engineering Programming Techniques Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-319-94144-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910349432403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Practice of Algorithms in (Computer) Systems [[electronic resource] ] : First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011, Proceedings / / edited by Alberto Marchetti-Spaccamela, Michael Segal
| Theory and Practice of Algorithms in (Computer) Systems [[electronic resource] ] : First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011, Proceedings / / edited by Alberto Marchetti-Spaccamela, Michael Segal |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (X, 266 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Machine theory Software engineering Computer simulation Artificial intelligence—Data processing Numerical analysis Formal Languages and Automata Theory Software Engineering Computer Modelling Data Science Numerical Analysis |
| ISBN | 3-642-19754-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465892603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Thinking Data Science : A Data Science Practitioner’s Guide / / by Poornachandra Sarang
| Thinking Data Science : A Data Science Practitioner’s Guide / / by Poornachandra Sarang |
| Autore | Sarang P. G (Poornachandra G.) |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (366 pages) : illustrations |
| Disciplina |
006.31
005.7 |
| Collana | The Springer Series in Applied Machine Learning |
| Soggetto topico |
Machine learning
Artificial intelligence - Data processing Artificial intelligence Machine Learning Data Science Artificial Intelligence Aprenentatge automàtic |
| Soggetto genere / forma | Llibres electrònics |
| ISBN |
9783031023637
9783031023620 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Chapter. 1. Data Science Process -- Chapter. 2. Dimensionality Reduction - Creating Manageable Training Datasets -- Chapter. 3. Classical Algorithms - Over-view -- Chapter. 4. Regression Analysis -- Chapter. 5. Decision Tree -- Chapter. 6. Ensemble - Bagging and Boosting -- Chapter. 7. K-Nearest Neighbors -- Chapter. 8. Naive Bayes -- Chapter. 9. Support Vector Machines: A supervised learning algorithm for Classification and Regression -- Chapter. 10. Clustering Overview -- Chapter. 11. Centroid-based Clustering -- Chapter. 12. Connectivity-based Clustering -- Chapter. 13. Gaussian Mixture Model -- Chapter. 14. Density-based -- Chapter. 15 -- BIRCH -- Chapter. 16. CLARANS -- Chapter. 17. Affinity Propagation Clustering -- Chapter. 18. STING -- Chapter. 19. CLIQUE -- Chapter. 20. Artificial Neural Networks -- Chapter. 21. ANN-based Applications -- Chapter. 22. Automated Tools -- Chapter. 23. Data Scientist’s Ultimate Workflow. |
| Record Nr. | UNINA-9910678248403321 |
Sarang P. G (Poornachandra G.)
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Topics in Theoretical Computer Science [[electronic resource] ] : The First IFIP WG 1.8 International Conference, TTCS 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers / / edited by Mohammed Taghi Hajiaghayi, Mohammad Reza Mousavi
| Topics in Theoretical Computer Science [[electronic resource] ] : The First IFIP WG 1.8 International Conference, TTCS 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers / / edited by Mohammed Taghi Hajiaghayi, Mohammad Reza Mousavi |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XV, 179 p. 52 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Computer graphics Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Theory of Computation Formal Languages and Automata Theory Computer Graphics Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-319-28678-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466052003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
