top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Algorithms and Data Structures : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
Algorithms and Data Structures : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings / / edited by Pat Morin, Subhash Suri
Autore Morin Pat
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (732 pages)
Disciplina 005.73
003.54
Altri autori (Persone) SuriSubhash
Collana Lecture Notes in Computer Science
Soggetto topico Data structures (Computer science)
Information theory
Algorithms
Computer engineering
Computer networks
Computer science—Mathematics
Discrete mathematics
Computer graphics
Data Structures and Information Theory
Design and Analysis of Algorithms
Computer Engineering and Networks
Symbolic and Algebraic Manipulation
Discrete Mathematics in Computer Science
Computer Graphics
Estructures de dades (Informàtica)
Algorismes
Matemàtica discreta
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 9783031389061
3031389069
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Geometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs.
Record Nr. UNINA-9910736011703321
Morin Pat  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms and Discrete Applied Mathematics : 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings / / edited by Niranjan Balachandran, R. Inkulu
Algorithms and Discrete Applied Mathematics : 8th International Conference, CALDAM 2022, Puducherry, India, February 10–12, 2022, Proceedings / / edited by Niranjan Balachandran, R. Inkulu
Edizione [1st ed. 2022.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Descrizione fisica 1 online resource (326 pages)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science—Mathematics
Algorithms
Data structures (Computer science)
Information theory
Discrete mathematics
Mathematics of Computing
Data Structures and Information Theory
Discrete Mathematics in Computer Science
Algorismes
Matemàtica discreta
Matemàtica aplicada
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 3-030-95018-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A proof of the Multiplicative 1-2-3 Conjecture -- The geodesic transversal problem on some networks -- Chromatic Bounds for Some Subclasses of $(P_3\cup P_2)$-free Graphs -- List homomorphisms to separable signed graphs -- Some position problems for graphs -- Comparability graphs among Cover-Incomparability graphs -- Complexity of Paired Domination in AT-free and Planar Graphs -- The Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs -- On Conflict-Free Spanning Tree: Algorithms and Complexity -- B0-VPG Representation of AT-free Outerplanar Graphs -- P versus NPC : Steiner tree in convex split graphs -- On cd-coloring of {P_5,K_4}-free chordal graphs -- An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs -- Covering a Graph with Densest Subgraphs -- Coresets for $(k, \ell)$-Median Clustering under the Fréchet Distance -- Bounds and Algorithms for Geodetic Hulls -- Voronoi Games using Geodesics -- Approximation and parameterized algorithms for balanced connected partition problems -- Algorithms for Online Car-sharing Problem -- Algebraic algorithms for variants of Subset Sum -- Hardness and Approximation Results for Some Variants of Stable Marriage Problem -- On Fair Division with Binary Valuations Respecting Social Networks -- Parameterized Intractability of Defensive Alliance Problem -- On the approximability of path and cycle problems in arc-dependent networks} -- Approximation Algorithms in Graphs with Known Broadcast time of the Base Graph.
Record Nr. UNINA-9910523889203321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithms for Constructing Computably Enumerable Sets / / by Kenneth J. Supowit
Algorithms for Constructing Computably Enumerable Sets / / by Kenneth J. Supowit
Autore Supowit Kenneth J.
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2023
Descrizione fisica 1 online resource (191 pages)
Disciplina 004.0151
Collana Computer Science Foundations and Applied Logic
Soggetto topico Computer science
Computable functions
Recursion theory
Set theory
Computer science—Mathematics
Theory of Computation
Computability and Recursion Theory
Set Theory
Theory and Algorithms for Application Domains
Mathematics of Computing
Matemàtica discreta
Teoria de conjunts
Algorismes
Soggetto genere / forma Llibres electrònics
ISBN 9783031269042
9783031269035
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1 Index of notation and terms -- 2 Set theory, requirements, witnesses -- 3 What’s new in this chapter? -- 4 Priorities (a splitting theorem) -- 5 Reductions, comparability (Kleene-Post Theorem) -- 6 Finite injury (Friedberg-Muchnik Theorem) -- 7 The Permanence Lemma -- 8 Permitting (Friedberg-Muchnik below C Theorem) -- 9 Length of agreement (Sacks Splitting Theorem) -- 10 Introduction to infinite injury -- 11 A tree of guesses (Weak Thickness Lemma) -- 12 An infinitely branching tree (Thickness Lemma) -- 13 True stages (another proof of the Thickness Lemma) -- 14 Joint custody (Minimal Pair Theorem) -- 15 Witness lists (Density Theorem) -- 16 The theme of this book: delaying tactics -- Appendix A: a pairing function -- Bibliograph -- Solutions to selected exercises.
Record Nr. UNINA-9910726280003321
Supowit Kenneth J.  
Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Applied Computational Mathematics : ICCE 2023, Chennai, India, December 8-9 / / edited by Indra Rajasingh, Sharmila Mary Arul, Diana Grace Thomas
Applied Computational Mathematics : ICCE 2023, Chennai, India, December 8-9 / / edited by Indra Rajasingh, Sharmila Mary Arul, Diana Grace Thomas
Autore Rajasingh Indra
Edizione [1st ed. 2025.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Descrizione fisica 1 online resource (484 pages)
Disciplina 004.0151
Altri autori (Persone) Mary ArulSharmila
Grace ThomasDiana
Collana Springer Proceedings in Mathematics & Statistics
Soggetto topico Computer science - Mathematics
Image processing - Digital techniques
Computer vision
Mathematics of Computing
Computer Imaging, Vision, Pattern Recognition and Graphics
Matemàtica discreta
Visió per ordinador
Processament digital d'imatges
Soggetto genere / forma Llibres electrònics
ISBN 9783031777646
9783031777639
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Part 1: Graph Theory -- Chapter 1: Optimizing Wirelength In Embedding Tur´An Graphs Into Complete -- Chapter 2: Square Difference Geometric Mean 3-Equitable Labeling of Certain -- Chapter 3: Domination Number In Sierpi´nski Networks -- Chapter 4: Vertex Prime and Edge Ternion Sum Labeling of Certain Centralized -- Chapter 5: Vertex Odd Mean(VOM) Labeling of Super Subdivision of Some Graphs -- Chapter 6: Burning Neural Networks With Harary Graphs for Optimal Connectivity -- Chapter 7: k-prime Total Labeling of Union of Graphs -- Chapter 8: Optimizing Wirelength In Graph Embedding: Folded Hypercube Into Fan And Windmill Networks - A Comparative Study -- Chapter 9: Connectedness and Distance Energy of Hamacher d-fuzzy graphs -- Chapter 10: Minimum Vertex Cover In Extended Fibonacci Cubes -- Chapter 11: Power Dominator Sum Coloring of Graphs -- Chapter 12: Roman Domination Number for Fractal Cubic Networks -- Chapter 13: Analyzing The Factors Associated With The Severity of Non Alcoholic Fatty Liver Disease (Nafld) Using Graph Theory and Matrix Approach Method -- Chapter 14: Some Results On Variants of Lucky Labeling of Extended Polytopes -- Chapter 15: Topological Indices of Vemurafenib For The Cure of Melanoma Cancer -- Chapter 16: Antimagic Labeling of Network Graphs -- Chapter 17: Edge Vertex Prime Labeling (Evpl) of Certain Trees And Graphs -- Chapter 18: Domination Equitable Coloring for Family of Ladder Graphs -- Chapter 19: Large Graphs With Small Burning Numbers -- Chapter 20: Equality of Domination Parameters in Certain Necklace Graphs -- Chapter 21: Centered Triangular Sum Labeling of m, n− snowflake graph -- Chapter 22: Paired Transmission In Networks -- Part 2: Fuzzy Mathematics -- Chapter 23: An Application of Generalized Fuzzy Soft Sets In Analyzing Student’s Performance Level During Online Mode of Education -- Chapter 24: Novel Similarity Measures for Linguistic Intuitionistic Fuzzy TOPSIS Method for Decision Support System -- Part 3: Statistics -- Chapter 25: The Analysis of The Value Of Π By Simulation Approach And Non-Parametric Statistical Testing of Hypothesis -- Chapter 26: Optimizing Quality of Service In Internet And Web Services Through A Two Stage Retrial Tandem Queuing Model With Working Vacation -- Part 4: Physics -- Chapter 27: An Analysis of MHD Thermally and Chemically Reactant Williamson Nanofluid Over an Exponentially Stretched Sheet with Joules Heating -- Chapter 28: Impact of Radiation and Dissipation On An Unsteady Nano Fluid Flow Over An Elongating Sheet -- Part 5: Miscellaneous -- Chapter 29: Modern Methodology of Medicine Versus Its Traditional One – A Theoretical Graph Approach -- Chapter 30: Parikh Matrices of Prouhet Array Morphic Images of Two-dimensional Arrays -- Chapter 31: Graph Analysis on Physiological Aging – A Theoretical Investigation -- Chapter 32: Multiset Quadripartioned Neutrosophic Cubic Topological Space -- Chapter 33: A Theoretical Graph Analysis On Eeg Controlled Bionic Arm With Importance To Senses of Human.
Record Nr. UNINA-9910984586303321
Rajasingh Indra  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Artificial Intelligence and Image Analysis : 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, Fort Lauderdale, FL, USA, January 8–10, 2024, Revised Selected Papers / / edited by Reneta P. Barneva, Valentin E. Brimkov, Claudio Gentile, Aldo Pacchiano
Artificial Intelligence and Image Analysis : 18th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2024, and 22nd International Workshop on Combinatorial Image Analysis, IWCIA 2024, Fort Lauderdale, FL, USA, January 8–10, 2024, Revised Selected Papers / / edited by Reneta P. Barneva, Valentin E. Brimkov, Claudio Gentile, Aldo Pacchiano
Autore Barneva Reneta P
Edizione [1st ed. 2024.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024
Descrizione fisica 1 online resource (269 pages)
Disciplina 006.37
Altri autori (Persone) BrimkovValentin E
GentileClaudio
PacchianoAldo
Collana Lecture Notes in Computer Science
Soggetto topico Computer vision
Image processing
Computer science - Mathematics
Discrete mathematics
Artificial intelligence
Computer networks
Computer Vision
Image Processing
Discrete Mathematics in Computer Science
Artificial Intelligence
Computer Communication Networks
Visió per ordinador
Processament d'imatges
Intel·ligència artificial
Matemàtica discreta
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 9783031637353
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto -- A Model for Optimizing Recalculation Schedules to Minimize Regret. -- A Theory of Learning with Competing Objectives and User Feedback. -- Trick Costs for $\alpha\mu$ and New Relatives. -- A Differential Approach for Several NP-hard Optimization Problems. -- On the Computational Complexities of Finding Selected Refutations of Linear Programs. -- Extending the Tractability of the Clique Problem via Graph Classes Generalizing Treewidth. -- Principled Approaches for Learning to Defer with Multiple Experts. -- On Sample Reuse Methods for Answering $k$-wise Statistical Queries. -- Neural Diffusion Graph Convolutional Network for Predicting Heat Transfer in Selective Laser Melting. -- New Proportion Measures of Discrimination Based on Natural Direct and Indirect Effects. -- Addressing Discretization Artifacts in Tomography by Accessing and Balancing Pixel Coverage of Projections. -- Finding the Straight Skeleton for 3D Orthogonal Polyhedrons: A Combinatorial Approach. -- Towards a Unifying View on Monotone Constructive Definitions. -- Partial Boolean Functions for QBF Semantics.
Record Nr. UNINA-9910874693603321
Barneva Reneta P  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Combinatorial and additive number theory IV : CANT, New York, USA, 2019 and 2020 / / Melvyn B. Nathanson, editor
Combinatorial and additive number theory IV : CANT, New York, USA, 2019 and 2020 / / Melvyn B. Nathanson, editor
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (viii, 445 pages) : illustrations
Disciplina 511.6
Collana Springer proceedings in mathematics & statistics
Soggetto topico Combinatorial number theory
Teoria de nombres
Matemàtica discreta
Teoria de grups
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 3-030-67996-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 0. Math in the Time of Covid (M.B. Nathanson) -- 1. Extremal sequences for some weighted zero-sum constants for cyclic groups (S.D. Adhikari, M.I. Molla, S. Paul) -- 2. On a zero-sum problem arising from factorization theory (A. Bashir, A. Geroldinger, Q. Zhong) -- 3. Conditional bounds on Siegel zeros (G. Bhowmik, K. Halupczok) -- 4. Infinite co-minimal pairs in the integers and integral lattices (A. Biswas, J.P. Saha) -- 5. Rigidity, graphs, and Hausdorff dimension (N. Chatzikonstantinou, A. Iosevich, S. Mkrtchyan, J. Pakianathan) -- 6. On generalized harmonic numbers (Y.-G. Chen, B.-L. Wu) -- 7. Partitions for semi-magic squares of size three (R. Donley) -- 8. A sum of negative degrees of the gaps values in two-generated numerical semigroups and identities for the Hurwitz zeta function (L.G. Fel, T. Komatsu, A.I. Suriajaya) -- 9. Widely digitally stable numbers (M. Filaseta, J. Juillerat, J. Southwick) -- 10. Non-injectivity of nonzero discriminant polynomials and applications to packing polynomials (K. Gjaldbæk) -- 11. Representing sequence subsums as sumsets of near equal sized sets (D.J. Grynkiewicz) -- 12. Bounds on point configurations determined by distances and dot products (S. Gunter, E. Palsson, B. Rhodes, and S. Senger) -- 13. Distribution of missing digits in diffsets (S. Harvey-Arnold, S.J. Miller, F. Peng) -- 14. Recent progress in Hilbert cubes theory (N. Hegyvarı) -- 15. Intrinsic characterization of representation functions and generalizations (C. Helou) -- 16. Combinatorics of multicompositions (B. Hopkins, S. Ouvrey) -- 17. A variant of the Elliott-Halberstam conjecture and the Goldbach conjecture (J.-J. Huang, H. Li) -- 18. Part-frequency matrices, II: Recent work (W. Keith) -- 19. A conjectural inequality for visible points in lattice parallelograms (G. Khan, M.R. Khan, J. Saha, P. Zhao) -- 20. On a two-dimensional exponential sum (A. Kumchev) -- 21. On consecutive perfect powers with elementary methods (P. Leonetti) -- 22. Sidon sets and perturbations (M.B. Nathanson) -- 23. Multiplicative representations and Ramsey's Theorem (M.B. Nathanson) -- 24. On distinct consecutive differences (I. Ruzsa, G. Shakan, J. Solymosi, E. Szemeredi) -- 25. Limit points of Nathanson’s lambda sequences (S. Singh).
Altri titoli varianti Combinatorial and additive number theory 4
Combinatorial and additive number theory four
Record Nr. UNISA-996466387603316
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorial and additive number theory IV : CANT, New York, USA, 2019 and 2020 / / Melvyn B. Nathanson, editor
Combinatorial and additive number theory IV : CANT, New York, USA, 2019 and 2020 / / Melvyn B. Nathanson, editor
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (viii, 445 pages) : illustrations
Disciplina 511.6
Collana Springer proceedings in mathematics & statistics
Soggetto topico Combinatorial number theory
Teoria de nombres
Matemàtica discreta
Teoria de grups
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 3-030-67996-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 0. Math in the Time of Covid (M.B. Nathanson) -- 1. Extremal sequences for some weighted zero-sum constants for cyclic groups (S.D. Adhikari, M.I. Molla, S. Paul) -- 2. On a zero-sum problem arising from factorization theory (A. Bashir, A. Geroldinger, Q. Zhong) -- 3. Conditional bounds on Siegel zeros (G. Bhowmik, K. Halupczok) -- 4. Infinite co-minimal pairs in the integers and integral lattices (A. Biswas, J.P. Saha) -- 5. Rigidity, graphs, and Hausdorff dimension (N. Chatzikonstantinou, A. Iosevich, S. Mkrtchyan, J. Pakianathan) -- 6. On generalized harmonic numbers (Y.-G. Chen, B.-L. Wu) -- 7. Partitions for semi-magic squares of size three (R. Donley) -- 8. A sum of negative degrees of the gaps values in two-generated numerical semigroups and identities for the Hurwitz zeta function (L.G. Fel, T. Komatsu, A.I. Suriajaya) -- 9. Widely digitally stable numbers (M. Filaseta, J. Juillerat, J. Southwick) -- 10. Non-injectivity of nonzero discriminant polynomials and applications to packing polynomials (K. Gjaldbæk) -- 11. Representing sequence subsums as sumsets of near equal sized sets (D.J. Grynkiewicz) -- 12. Bounds on point configurations determined by distances and dot products (S. Gunter, E. Palsson, B. Rhodes, and S. Senger) -- 13. Distribution of missing digits in diffsets (S. Harvey-Arnold, S.J. Miller, F. Peng) -- 14. Recent progress in Hilbert cubes theory (N. Hegyvarı) -- 15. Intrinsic characterization of representation functions and generalizations (C. Helou) -- 16. Combinatorics of multicompositions (B. Hopkins, S. Ouvrey) -- 17. A variant of the Elliott-Halberstam conjecture and the Goldbach conjecture (J.-J. Huang, H. Li) -- 18. Part-frequency matrices, II: Recent work (W. Keith) -- 19. A conjectural inequality for visible points in lattice parallelograms (G. Khan, M.R. Khan, J. Saha, P. Zhao) -- 20. On a two-dimensional exponential sum (A. Kumchev) -- 21. On consecutive perfect powers with elementary methods (P. Leonetti) -- 22. Sidon sets and perturbations (M.B. Nathanson) -- 23. Multiplicative representations and Ramsey's Theorem (M.B. Nathanson) -- 24. On distinct consecutive differences (I. Ruzsa, G. Shakan, J. Solymosi, E. Szemeredi) -- 25. Limit points of Nathanson’s lambda sequences (S. Singh).
Altri titoli varianti Combinatorial and additive number theory 4
Combinatorial and additive number theory four
Record Nr. UNINA-9910494564003321
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings / / edited by Anna Frid, Robert Mercaş
Combinatorics on Words : 14th International Conference, WORDS 2023, Umeå, Sweden, June 12–16, 2023, Proceedings / / edited by Anna Frid, Robert Mercaş
Autore Frid Anna
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (310 pages)
Disciplina 511.6
Altri autori (Persone) MercaşRobert
Collana Lecture Notes in Computer Science
Soggetto topico Machine theory
Computer networks
Algorithms
Natural language processing (Computer science)
Computer science—Mathematics
Discrete mathematics
Formal Languages and Automata Theory
Computer Communication Networks
Natural Language Processing (NLP)
Discrete Mathematics in Computer Science
Anàlisi combinatòria
Matemàtica discreta
Tractament del llenguatge natural (Informàtica)
Soggetto genere / forma Congressos
Llibres electrònics
ISBN 9783031331800
303133180X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers: Minimal Complexities for Infinite Words Written with d Letters -- Alternate Base Numeration Systems -- On the number of distinct squares in finite sequences: some old and new results. Contributed Papers: Ranking and Unranking k-Subsequence Universal Words -- Longest common subsequence with gap constraints -- On Substitutions Preserving their Return Sets -- Recurrence and frequencies -- Sturmian and infinitely desubstitutable words accepted by an ω-automaton -- String attractors for factors of the Thue-Morse word -- Critical exponent of Arnoux-Rauzy sequences -- On a class of 2-balanced sequences -- Order conditions for languages -- On Sensitivity of Compact Directed Acyclic Word Graphs -- Smallest and Largest Block Palindrome Factorizations -- String attractors of fixed points of k-bonacci-like morphisms -- Magic Numbers in Periodic Sequences -- Dyck Words, Pattern Avoidance, and Automatic Sequences -- Rudin-Shapiro Sums Via Automata Theory and Logic -- Automaticity and Parikh-collinear morphisms -- On the solution sets of entire systems of word equations -- On arch factorization and subword universality for words and compressed words -- Characteristic sequences of the sets of sums of squares as columns of cellular automata.
Record Nr. UNINA-9910728947403321
Frid Anna  
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computational mathematics and modeling
Computational mathematics and modeling
Pubbl/distr/stampa [New York, N.Y.], : Springer
Disciplina 510.285
Soggetto topico Mathematics - Data processing
Mathematical models
Models, Theoretical
Mathématiques - Informatique
Modèles mathématiques
mathematical models
Computers
Mathematics
Matemàtica discreta
Models matemàtics
Soggetto genere / forma periodicals.
Periodicals.
Périodiques.
Revistes electròniques.
ISSN 1573-837X
Formato Materiale a stampa
Livello bibliografico Periodico
Lingua di pubblicazione eng
Record Nr. UNINA-9910139550603321
[New York, N.Y.], : Springer
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Deterministic, Stochastic, and Deep Learning Methods for Computational Electromagnetics / / by Wei Cai
Deterministic, Stochastic, and Deep Learning Methods for Computational Electromagnetics / / by Wei Cai
Autore Cai Wei
Edizione [2nd ed. 2025.]
Pubbl/distr/stampa Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025
Descrizione fisica 1 online resource (931 pages)
Disciplina 518
Soggetto topico Numerical analysis
Differential equations
Electrical engineering
Machine learning
Mathematics - Data processing
Mathematical physics
Numerical Analysis
Differential Equations
Electrical and Electronic Engineering
Machine Learning
Computational Mathematics and Numerical Analysis
Theoretical, Mathematical and Computational Physics
Anàlisi numèrica
Equacions diferencials
Enginyeria elèctrica
Aprenentatge automàtic
Processament de dades
Física matemàtica
Matemàtica discreta
Soggetto genere / forma Llibres electrònics
ISBN 9789819601004
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Dielectric constant and fluctuation formulae for molecular dynamics -- Poisson–Boltzmann electrostatics and analytical approximations -- Numerical methods for Poisson–Boltzmann equations -- Random walk stochastic methods for boundary value problems -- Deep Neural Network for Solving PDEs -- Fast algorithms for long-range interactions -- Fast multipole methods for long-range interactions in layered media -- Maxwell equations, potentials, and physical/artificial boundary conditions -- Dyadic Green’s functions in layered media -- High-order methods for surface electromagnetic integral equations -- High-order hierarchical N´ed´elec edge elements -- Time-domain methods – discontinuous Galerkin method and Yee scheme -- Scattering in periodic structures and surface plasmons -- Schr¨ odinger equations for waveguides and quantum dots -- Quantum electron transport in semiconductors -- Non-equilibrium Green’s function (NEGF) methods for transport -- Numerical methods for Wigner quantum transport -- Hydrodynamic electron transport and finite difference methods -- Transport models in plasma media and numerical methods.
Record Nr. UNINA-9910984695703321
Cai Wei  
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui

Opere

Altro...

Lingua di pubblicazione

Altro...

Data

Data di pubblicazione

Altro...