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.
Advanced Intelligent Virtual Reality Technologies [[electronic resource] ] : Proceedings of 6th International Conference on Artificial Intelligence and Virtual Reality (AIVR 2022) / / edited by Kazumi Nakamatsu, Srikanta Patnaik, Roumen Kountchev, Ruidong Li, Ari Aharari
Advanced Intelligent Virtual Reality Technologies [[electronic resource] ] : Proceedings of 6th International Conference on Artificial Intelligence and Virtual Reality (AIVR 2022) / / edited by Kazumi Nakamatsu, Srikanta Patnaik, Roumen Kountchev, Ruidong Li, Ari Aharari
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (255 pages)
Disciplina 006.3
Collana Smart Innovation, Systems and Technologies
Soggetto topico Computational intelligence
Artificial intelligence
Virtual reality
Augmented reality
Artificial intelligence—Data processing
Computational Intelligence
Artificial Intelligence
Virtual and Augmented Reality
Data Science
ISBN 981-19-7742-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Part 1: Invited Paper -- Chapter 1. Paraconsistency and Paracompleteness in AI: Review Paper -- Part 2: Regular Papers -- Chapter 2. Decision Support Multi-agent Modeling and Simulation of Aeronautic Marine Oil Spill Response -- Chapter 3. Transferring Dense Object Detection Models to Event-based Data -- Chapter 4. Diagnosing Parkinson’s Disease Based on Voice Recordings: Comparative Study Using Machine Learning Techniques -- Chapter 5. Elements of Continuous Reassessment and Uncertainty Self-Awareness: A Narrow Implementation for Face and Facial Expression Recognition -- Chapter 6. Topic-aware Networks for Answer Selection -- Chapter 7. Design and Implementation of Multi_Scene Immersive Ancient Style Interaction System Based on Unreal Engine Platform -- Chapter 8. Auxiliary Figure Presentation Associated with Sweating on a Viewer’s Hand in order to Reduce VR Sickness -- Chapter 9. Design and Implementation of Immersive Display Interactive System Based on New Virtual Reality -- Chapter 10. 360-Degree Virtual Reality Videos in EFL Teaching: Student Experiences -- Chapter 11. Research on Chinese Garden Art Appreciation Based on Virtual Technology -- Chapter 12. Medical-Network (Med-Net): A Neural Network for Breast Cancer Segmentation in Ultrasound Image -- Chapter 13. Auxiliary Squat Training Method Based on Object Tracking -- Chapter 14. Study on the Visualization Modeling of Aviation Emergency Rescue System Based on Systems Engineering -- Chapter 15. An AI-based System Offering Automatic DR-enhanced AR for Indoor Scenes -- Chapter 16. Extending Mirror Therapy into Mixed Reality – Design and Implementation of the application PhantomAR to alleviate phantom limb pain in upper limb amputees -- Chapter 17. An Analysis of Trends and Problems of Information Technology Application Research in China's Accounting Field based on CiteSpace -- Chapter 18. Augmented Reality Framework and Application for Aviation Emergency Rescue Based on Multi-Agent and Service. .
Record Nr. UNINA-9910645892903321
Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Adventures Between Lower Bounds and Higher Altitudes [[electronic resource] ] : Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday / / edited by Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger
Adventures Between Lower Bounds and Higher Altitudes [[electronic resource] ] : Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday / / edited by Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (XXIV, 642 p. 134 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Artificial intelligence
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Social sciences—Data processing
Theory of Computation
Artificial Intelligence
Data Science
Discrete Mathematics in Computer Science
Computer Application in Social and Behavioral Sciences
ISBN 3-319-98355-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Automata and Formal Languages -- Algorithmics -- Computer Science Education.
Record Nr. UNISA-996466368303316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Adventures Between Lower Bounds and Higher Altitudes [[electronic resource] ] : Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday / / edited by Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger
Adventures Between Lower Bounds and Higher Altitudes [[electronic resource] ] : Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday / / edited by Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger
Edizione [1st ed. 2018.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Descrizione fisica 1 online resource (XXIV, 642 p. 134 illus.)
Disciplina 005.1
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Artificial intelligence
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Social sciences—Data processing
Theory of Computation
Artificial Intelligence
Data Science
Discrete Mathematics in Computer Science
Computer Application in Social and Behavioral Sciences
ISBN 3-319-98355-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Automata and Formal Languages -- Algorithmics -- Computer Science Education.
Record Nr. UNINA-9910349410203321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algebraic Informatics [[electronic resource] ] : 8th International Conference, CAI 2019, Niš, Serbia, June 30–July 4, 2019, Proceedings / / edited by Miroslav Ćirić, Manfred Droste, Jean-Éric Pin
Algebraic Informatics [[electronic resource] ] : 8th International Conference, CAI 2019, Niš, Serbia, June 30–July 4, 2019, Proceedings / / edited by Miroslav Ćirić, Manfred Droste, Jean-Éric Pin
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XVI, 259 p. 273 illus., 22 illus. in color.)
Disciplina 005.13
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Artificial intelligence—Data processing
Numerical analysis
Computer science—Mathematics
Discrete mathematics
Algorithms
Coding theory
Information theory
Computer Science Logic and Foundations of Programming
Data Science
Numerical Analysis
Discrete Mathematics in Computer Science
Coding and Information Theory
ISBN 3-030-21363-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996466325003316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algebraic Informatics [[electronic resource] ] : 8th International Conference, CAI 2019, Niš, Serbia, June 30–July 4, 2019, Proceedings / / edited by Miroslav Ćirić, Manfred Droste, Jean-Éric Pin
Algebraic Informatics [[electronic resource] ] : 8th International Conference, CAI 2019, Niš, Serbia, June 30–July 4, 2019, Proceedings / / edited by Miroslav Ćirić, Manfred Droste, Jean-Éric Pin
Edizione [1st ed. 2019.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Descrizione fisica 1 online resource (XVI, 259 p. 273 illus., 22 illus. in color.)
Disciplina 005.13
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Artificial intelligence—Data processing
Numerical analysis
Computer science—Mathematics
Discrete mathematics
Algorithms
Coding theory
Information theory
Computer Science Logic and Foundations of Programming
Data Science
Numerical Analysis
Discrete Mathematics in Computer Science
Coding and Information Theory
ISBN 3-030-21363-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910337843303321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Engineering [[electronic resource] ] : Bridging the Gap Between Algorithm Theory and Practice / / edited by Matthias Müller-Hannemann, Stefan Schirra
Algorithm Engineering [[electronic resource] ] : Bridging the Gap Between Algorithm Theory and Practice / / edited by Matthias Müller-Hannemann, Stefan Schirra
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (XVI, 513 p. 72 illus.)
Disciplina 004.01/5181
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Machine theory
Software engineering
Computer simulation
Artificial intelligence—Data processing
Programming Techniques
Formal Languages and Automata Theory
Software Engineering
Computer Modelling
Data Science
ISBN 3-642-14866-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Foundations of Algorithm Engineering -- 2. Modeling -- 3. Selected Design Issues -- 4. Analysis of Algorithms -- 5. Realistic Computer Models -- 6. Implementation Aspects -- 7. Libraries -- 8. Experiments -- 9. Case Studies -- 10. Challenges in Algorithm Engineering.
Record Nr. UNISA-996466205703316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Engineering [[electronic resource] ] : Bridging the Gap Between Algorithm Theory and Practice / / edited by Matthias Müller-Hannemann, Stefan Schirra
Algorithm Engineering [[electronic resource] ] : Bridging the Gap Between Algorithm Theory and Practice / / edited by Matthias Müller-Hannemann, Stefan Schirra
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (XVI, 513 p. 72 illus.)
Disciplina 004.01/5181
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Machine theory
Software engineering
Computer simulation
Artificial intelligence—Data processing
Programming Techniques
Formal Languages and Automata Theory
Software Engineering
Computer Modelling
Data Science
ISBN 3-642-14866-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto 1. Foundations of Algorithm Engineering -- 2. Modeling -- 3. Selected Design Issues -- 4. Analysis of Algorithms -- 5. Realistic Computer Models -- 6. Implementation Aspects -- 7. Libraries -- 8. Experiments -- 9. Case Studies -- 10. Challenges in Algorithm Engineering.
Record Nr. UNINA-9910484573703321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Theory - SWAT 2006 [[electronic resource] ] : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings / / edited by Lars Arge, Rusins Freivalds
Algorithm Theory - SWAT 2006 [[electronic resource] ] : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings / / edited by Lars Arge, Rusins Freivalds
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XII, 436 p.)
Disciplina 511.8
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer networks
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Computer graphics
Computer Communication Networks
Data Science
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-540-35755-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily) -- Results and Problems on Self-adjusting Search Trees and Related Data Structures -- Classic and Quantum Network Coding -- Contributed Papers -- Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers -- Scheduling Jobs on Grid Processors -- Variable Sized Online Interval Coloring with Bandwidth -- A Simpler Linear-Time Recognition of Circular-Arc Graphs -- An Algorithm for Online Topological Ordering -- Dynamic Matching Markets and Voting Paths -- Sorting by Merging or Merging by Sorting? -- Finding the Position of the k-Mismatch and Approximate Tandem Repeats -- Unbiased Matrix Rounding -- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines -- Paging with Request Sets -- Decentralization and Mechanism Design for Online Machine Scheduling -- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes -- Exact Computation of Maximum Induced Forest -- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus -- On the Approximation Hardness of Some Generalizations of TSP -- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours -- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights -- On Guarding Rectilinear Domains -- Approximation Algorithms for the Minimum Convex Partition Problem -- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles -- Simultaneous Embedding with Two Bends per Edge in Polynomial Area -- Acyclic Orientation of Drawings -- Improved Algorithms for Quantum Identification of Boolean Oracles -- Approximability of Minimum AND-Circuits -- Triangles, 4-Cycles and Parameterized (In-)Tractability -- Better Approximation Schemes for Disk Graphs -- An Approximation Algorithm for the Wireless Gathering Problem -- Minimum Membership Set Covering and the Consecutive Ones Property -- Approximating Rational Objectives Is as Easy as Approximating Linear Ones -- In-Place Algorithms for Computing (Layers of) Maxima -- Largest and Smallest Tours and Convex Hulls for Imprecise Points -- On Spanners of Geometric Graphs -- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems -- Linear-Time Algorithms for Tree Root Problems -- Generalized Powers of Graphs and Their Algorithmic Use.
Record Nr. UNISA-996465858203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithm Theory - SWAT 2006 [[electronic resource] ] : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings / / edited by Lars Arge, Rusins Freivalds
Algorithm Theory - SWAT 2006 [[electronic resource] ] : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings / / edited by Lars Arge, Rusins Freivalds
Edizione [1st ed. 2006.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Descrizione fisica 1 online resource (XII, 436 p.)
Disciplina 511.8
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer networks
Artificial intelligence—Data processing
Computer science—Mathematics
Discrete mathematics
Computer graphics
Computer Communication Networks
Data Science
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-540-35755-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Top-Down Analysis of Path Compression: Deriving the Inverse-Ackermann Bound Naturally (and Easily) -- Results and Problems on Self-adjusting Search Trees and Related Data Structures -- Classic and Quantum Network Coding -- Contributed Papers -- Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers -- Scheduling Jobs on Grid Processors -- Variable Sized Online Interval Coloring with Bandwidth -- A Simpler Linear-Time Recognition of Circular-Arc Graphs -- An Algorithm for Online Topological Ordering -- Dynamic Matching Markets and Voting Paths -- Sorting by Merging or Merging by Sorting? -- Finding the Position of the k-Mismatch and Approximate Tandem Repeats -- Unbiased Matrix Rounding -- Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines -- Paging with Request Sets -- Decentralization and Mechanism Design for Online Machine Scheduling -- Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes -- Exact Computation of Maximum Induced Forest -- Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus -- On the Approximation Hardness of Some Generalizations of TSP -- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours -- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights -- On Guarding Rectilinear Domains -- Approximation Algorithms for the Minimum Convex Partition Problem -- Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles -- Simultaneous Embedding with Two Bends per Edge in Polynomial Area -- Acyclic Orientation of Drawings -- Improved Algorithms for Quantum Identification of Boolean Oracles -- Approximability of Minimum AND-Circuits -- Triangles, 4-Cycles and Parameterized (In-)Tractability -- Better Approximation Schemes for Disk Graphs -- An Approximation Algorithm for the Wireless Gathering Problem -- Minimum Membership Set Covering and the Consecutive Ones Property -- Approximating Rational Objectives Is as Easy as Approximating Linear Ones -- In-Place Algorithms for Computing (Layers of) Maxima -- Largest and Smallest Tours and Convex Hulls for Imprecise Points -- On Spanners of Geometric Graphs -- The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems -- Linear-Time Algorithms for Tree Root Problems -- Generalized Powers of Graphs and Their Algorithmic Use.
Record Nr. UNINA-9910484883103321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Theory - SWAT 2010 [[electronic resource] ] : 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings / / edited by Haim Kaplan
Algorithm Theory - SWAT 2010 [[electronic resource] ] : 12th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings / / edited by Haim Kaplan
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (448 p. 69 illus.)
Disciplina 005.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Computer science—Mathematics
Discrete mathematics
Computer graphics
Artificial intelligence—Data processing
Computer science
Programming Techniques
Discrete Mathematics in Computer Science
Computer Graphics
Data Science
Theory of Computation
ISBN 1-280-38728-9
9786613565204
3-642-13731-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimal Exploration of Terrains with Obstacles -- Reconstructing a Simple Polygon from Its Angles -- Semidefinite Programming and Approximation Algorithms: A Survey -- Strictly-Regular Number System and Data Structures -- An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times -- The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition -- A Bottom-Up Method and Fast Algorithms for max independent set -- Capacitated Domination Faster Than O(2 n ) -- Isomorphism for Graphs of Bounded Feedback Vertex Set Number -- On Feedback Vertex Set New Measure and New Structures -- Conflict-Free Coloring Made Stronger -- Polychromatic Coloring for Half-Planes -- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem -- Minimum and Maximum against k Lies -- Feasible and Accurate Algorithms for Covering Semidefinite Programs -- The Quantitative Analysis of User Behavior Online – Data, Models and Algorithms -- Systems of Linear Equations over and Problems Parameterized above Average -- Capacitated max -Batching with Interval Graph Compatibilities -- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs -- Representing a Functional Curve by Curves with Fewer Peaks -- Bregman Clustering for Separable Instances -- Improved Methods For Generating Quasi-gray Codes -- The MST of Symmetric Disk Graphs Is Light -- Vector Bin Packing with Multiple-Choice -- Bin Packing with Fixed Number of Bins Revisited -- Cops and Robber Game without Recharging -- Path Schematization for Route Sketches -- Approximation Algorithms for Free-Label Maximization -- Phase Transitions in Sampling Algorithms and the Underlying Random Structures -- Polynomial Kernels for Hard Problems on Disk Graphs -- Faster Parameterized Algorithms for Minor Containment -- Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing -- Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput -- Online Function Tracking with Generalized Penalties -- Better Bounds on Online Unit Clustering -- Online Selection of Intervals and t-Intervals -- Approximating the Maximum 3- and 4-Edge-Colorable Subgraph -- Improved Algorithm for Degree Bounded Survivable Network Design Problem -- Minimizing the Diameter of a Network Using Shortcut Edges.
Record Nr. UNISA-996465663703316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui