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.
Algorithms - ESA 2010 [[electronic resource] ] : 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings / / edited by Mark de Berg, Ulrich Meyer
| Algorithms - ESA 2010 [[electronic resource] ] : 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings / / edited by Mark de Berg, Ulrich Meyer |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XVIII, 587 p. 68 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Algorithms Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Software Engineering Computer Communication Networks Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis |
| ISBN |
1-280-38904-4
9786613566966 3-642-15775-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- The Robustness of Level Sets -- Session 1a -- Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods -- Non-clairvoyant Speed Scaling for Weighted Flow Time -- A Robust PTAS for Machine Covering and Packing -- Session 1b -- Balancing Degree, Diameter and Weight in Euclidean Spanners -- Testing Euclidean Spanners -- Fast Approximation in Subspaces by Doubling Metric Decomposition -- f-Sensitivity Distance Oracles and Routing Schemes -- Session 2a -- Fast Minor Testing in Planar Graphs -- On the Number of Spanning Trees a Planar Graph Can Have -- Contractions of Planar Graphs in Polynomial Time -- Session 2b -- Communication Complexity of Quasirandom Rumor Spreading -- A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing -- Contribution Games in Social Networks -- Session 3a -- Improved Bounds for Online Stochastic Matching -- Online Stochastic Packing Applied to Display Ad Allocation -- Caching Is Hard – Even in the Fault Model -- Session 3b -- Superselectors: Efficient Constructions and Applications -- Estimating the Average of a Lipschitz-Continuous Function from One Sample -- Streaming Graph Computations with a Helpful Advisor -- Session 4a -- Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier -- Minimum Vertex Cover in Rectangle Graphs -- Feedback Vertex Sets in Tournaments -- Session 4b -- n-Level Graph Partitioning -- Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns -- Finding the Diameter in Real-World Graphs -- Session 5a -- Budgeted Red-Blue Median and Its Generalizations -- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables -- Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems -- Robust Algorithms for Sorting Railway Cars -- Session 5b -- Cloning Voronoi Diagrams via Retroactive Data Structures -- A Unified Approach to Approximate Proximity Searching -- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data -- Constructing the Exact Voronoi Diagram of Arbitrary Lines in Three-Dimensional Space -- Invited Talk -- Local Graph Exploration and Fast Property Testing -- Session 6a -- A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings -- Fast Prefix Search in Little Space, with Applications -- On the Huffman and Alphabetic Tree Problem with General Cost Functions -- Medium-Space Algorithms for Inverse BWT -- Session 6b -- Median Trajectories -- Optimal Cover of Points by Disks in a Simple Polygon -- Stability of ?-Kernels -- The Geodesic Diameter of Polygonal Domains -- Session 7a -- Polyhedral and Algorithmic Properties of Quantified Linear Programs -- Approximating Parameterized Convex Optimization Problems -- Approximation Schemes for Multi-Budgeted Independence Systems -- Session 7b -- Algorithmic Meta-theorems for Restrictions of Treewidth -- Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus -- Constructing the R* Consensus Tree of Two Trees in Subcubic Time. |
| Record Nr. | UNISA-996465936103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms -- ESA 2010, Part II [[electronic resource] ] : 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings / / edited by Mark de Berg, Ulrich Meyer
| Algorithms -- ESA 2010, Part II [[electronic resource] ] : 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010, Proceedings / / edited by Mark de Berg, Ulrich Meyer |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XVII, 245 p. 28 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Computer networks Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Programming Techniques Computer Communication Networks Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis |
| ISBN |
1-280-38905-2
9786613566973 3-642-15781-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Data Structures: Time, I/Os, Entropy, Joules! -- Session 8a -- Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness -- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games -- Combinatorial Auctions with Verification Are Tractable -- How to Allocate Goods in an Online Market? -- Session 8b -- Fréchet Distance of Surfaces: Some Simple Hard Cases -- Geometric Algorithms for Private-Cache Chip Multiprocessors -- Volume in General Metric Spaces -- Shortest Cut Graph of a Surface with Prescribed Vertex Set -- Session 9a -- Induced Matchings in Subcubic Planar Graphs -- Robust Matchings and Matroid Intersections -- A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties -- Strongly Stable Assignment -- Session 9b -- Data Structures for Storing Small Sets in the Bitprobe Model -- On Space Efficient Two Dimensional Range Minimum Data Structures -- Pairing Heaps with Costless Meld -- Top-k Ranked Document Search in General Text Databases -- Best-Paper Session -- Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time -- When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings -- Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems. |
| Record Nr. | UNISA-996465936903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for Big Data [[electronic resource] ] : DFG Priority Program 1736 / / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck
| Algorithms for Big Data [[electronic resource] ] : DFG Priority Program 1736 / / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck |
| Autore | Bast Hannah |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (296 pages) |
| Disciplina | 004.6 |
| Altri autori (Persone) |
KorzenClaudius
MeyerUlrich PenschuckManuel |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer networks
Data structures (Computer science) Information theory Computer science—Mathematics Algorithms Computer Communication Networks Data Structures and Information Theory Mathematics of Computing Design and Analysis of Algorithms |
| ISBN | 3-031-21534-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Large and Complex Networks Algorithms for Large-scale Network Analysis and the NetworKit Toolkit -- Generating Synthetic Graph Data from Random Network Models -- Sampling Efficiency for the Link Assessment Problem -- A Custom Hardware Architecture for the Link Assessment Problem -- Graph-based Methods for Rational Drug Design -- Recent Advances in Practical Data Reduction -- Skeleton-based Clustering by Quasi-Threshold Editing -- The Space Complexity of Undirected Graph Exploration -- Algorithms for Big Data and their Applications Scalable Cryptography -- Distributed Data Streams -- Energy-Efficient Scheduling -- The GENO Software Stack -- Laue Algorithms for Big Data Problems in de Novo Genome Assembly -- Scalable Text Index Construction. Big Data, Scalability, Algorithms, Applications, Graphs, Networks, Parallelism, Distributed, Memory Hierarchy, Algorithm Engineering, Network Analysis, Random Graphs, Graph Clustering, Data Streams, Cryptography, Energy Efficiency, Text Indices. |
| Record Nr. | UNISA-996508668503316 |
Bast Hannah
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for Big Data : DFG Priority Program 1736 / / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck
| Algorithms for Big Data : DFG Priority Program 1736 / / edited by Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck |
| Autore | Bast Hannah |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham, : Springer Nature, 2022 |
| Descrizione fisica | 1 online resource (296 pages) |
| Disciplina | 004.6 |
| Altri autori (Persone) |
KorzenClaudius
MeyerUlrich PenschuckManuel |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer networks
Data structures (Computer science) Information theory Computer science—Mathematics Algorithms Computer Communication Networks Data Structures and Information Theory Mathematics of Computing Design and Analysis of Algorithms Algorismes computacionals Dades massives |
| Soggetto genere / forma | Llibres electrònics |
| ISBN |
9783031215346
3031215346 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms for Large and Complex Networks Algorithms for Large-scale Network Analysis and the NetworKit Toolkit -- Generating Synthetic Graph Data from Random Network Models -- Sampling Efficiency for the Link Assessment Problem -- A Custom Hardware Architecture for the Link Assessment Problem -- Graph-based Methods for Rational Drug Design -- Recent Advances in Practical Data Reduction -- Skeleton-based Clustering by Quasi-Threshold Editing -- The Space Complexity of Undirected Graph Exploration -- Algorithms for Big Data and their Applications Scalable Cryptography -- Distributed Data Streams -- Energy-Efficient Scheduling -- The GENO Software Stack -- Laue Algorithms for Big Data Problems in de Novo Genome Assembly -- Scalable Text Index Construction. Big Data, Scalability, Algorithms, Applications, Graphs, Networks, Parallelism, Distributed, Memory Hierarchy, Algorithm Engineering, Network Analysis, Random Graphs, Graph Clustering, Data Streams, Cryptography, Energy Efficiency, Text Indices. |
| Record Nr. | UNINA-9910645977903321 |
|
Bast Hannah
|
||
| Cham, : Springer Nature, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms for Memory Hierarchies [[electronic resource] ] : Advanced Lectures / / edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn
| Algorithms for Memory Hierarchies [[electronic resource] ] : Advanced Lectures / / edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XV, 429 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer engineering
Algorithms Software engineering Operating systems (Computers) Data structures (Computer science) Computer Engineering Algorithm Analysis and Problem Complexity Software Engineering Operating Systems Data Storage Representation Data Structures and Information Theory |
| ISBN | 3-540-36574-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Memory Hierarchies — Models and Lower Bounds -- Basic External Memory Data Structures -- A Survey of Techniques for Designing I/O-Efficient Algorithms -- Elementary Graph Algorithms in External Memory -- I/O-Efficient Algorithms for Sparse Graphs -- External Memory Computational Geometry Revisited -- Full-Text Indexes in External Memory -- Algorithms for Hardware Caches and TLB -- Cache Oblivious Algorithms -- An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms -- Memory Limitations in Artificial Intelligence -- Algorithmic Approaches for Storage Networks -- An Overview of File System Architectures -- Exploitation of the Memory Hierarchy in Relational DBMSs -- Hierarchical Models and Software Tools for Parallel Programming -- Case Study: Memory Conscious Parallel Sorting. |
| Record Nr. | UNISA-996466147303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms for Memory Hierarchies : Advanced Lectures / / edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn
| Algorithms for Memory Hierarchies : Advanced Lectures / / edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XV, 429 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer engineering
Algorithms Software engineering Operating systems (Computers) Data structures (Computer science) Computer Engineering Algorithm Analysis and Problem Complexity Software Engineering Operating Systems Data Storage Representation Data Structures and Information Theory |
| ISBN | 3-540-36574-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Memory Hierarchies — Models and Lower Bounds -- Basic External Memory Data Structures -- A Survey of Techniques for Designing I/O-Efficient Algorithms -- Elementary Graph Algorithms in External Memory -- I/O-Efficient Algorithms for Sparse Graphs -- External Memory Computational Geometry Revisited -- Full-Text Indexes in External Memory -- Algorithms for Hardware Caches and TLB -- Cache Oblivious Algorithms -- An Overview of Cache Optimization Techniques and Cache-Aware Numerical Algorithms -- Memory Limitations in Artificial Intelligence -- Algorithmic Approaches for Storage Networks -- An Overview of File System Architectures -- Exploitation of the Memory Hierarchy in Relational DBMSs -- Hierarchical Models and Software Tools for Parallel Programming -- Case Study: Memory Conscious Parallel Sorting. |
| Record Nr. | UNINA-9910145911103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Fundamentals of Craniofacial Malformations : Vol. 1, Disease and Diagnostics / / edited by Ulrich Meyer
| Fundamentals of Craniofacial Malformations : Vol. 1, Disease and Diagnostics / / edited by Ulrich Meyer |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (394 pages) |
| Disciplina | 617.5107572 |
| Soggetto topico |
Mouth - Surgery
Surgery Dentistry Oral and Maxillofacial Surgery |
| ISBN | 3-030-46024-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction. I General aspects: 1. Normal craniofacial development -- 2. Developmental biology of the face -- 3. Animal models of facial development -- 4. Anthrophosophical aspects of facial development -- 5. Pathological approaches for craniofacial diseases -- 6. Classification of craniofacial malformations. II Biological basis of disease: 7. Chromosomal aberrations -- 8. Orofacial clefts -- 9. Craniosynostoses -- 10. Branchio-oculo-facial syndromes -- 11. Conjoined twins -- 12. Craniofacial Soft tissue malformations -- 13. Postural head deformations -- 14. Dysgnathias -- 15. Rare craniofacial syndromes. III Psychological aspects of disease: 16. Facial appearance and the psychological impact -- 17. Psychological evaluation methods for patients with craniofacial malformations -- 18. Psychological therapies for patients with craniofacial malformations -- 19. Psycho-social impact of craniofacial malformations on treatment and outcome -- 20. Evolution of Craniofacial Surgery -- 21. Quality of life aspects of craniofacial malformations -- 22. Long term outcome of craniofacial surgery -- 23. Benchmarking and cost assessment of craniofacial surgery -- 24. Medical and malpractice claims in craniofacial surgery. IV Diagnostic issues: 25. Clinical Investigations of craniofacial malformations -- 26. Interdisciplinary approach to the treatment of craniofacial malformations -- 27. Craniomaxillofacial investigation -- 28. Neurosurgical investigation of craniofacial malformations -- 29. ENT investigation of craniofacial malformations -- 30. Ocular investigation of craniofacial malformations -- 31. Radiological Investigations of craniofacial malformations -- 32. Genetic investigations of craniofacial malformations -- 33. Speech issues in patients with craniofacial malformations -- 34. Feeding issues in patients with craniofacial malformations -- 35. Breathing disorders in patients with craniofacial malformations. |
| Record Nr. | UNINA-9910488697603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||