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.
Algorithmic Aspects in Information and Management [[electronic resource] ] : 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008, Proceedings / / edited by Rudolf Fleischer, Jinhui Xu
| Algorithmic Aspects in Information and Management [[electronic resource] ] : 4th International Conference, AAIM 2008, Shanghai, China, June 23-25, 2008, Proceedings / / edited by Rudolf Fleischer, Jinhui Xu |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XI, 352 p.) |
| Disciplina | 005.1 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Software engineering
Algorithms Data structures (Computer science) Computer science—Mathematics Numerical analysis Mathematical statistics Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Numeric Computing Probability and Statistics in Computer Science |
| ISBN | 3-540-68880-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Double Partition: (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Nash Bargaining Via Flexible Budget Markets -- On the Minimum Hitting Set of Bundles Problem -- Speed Scaling with a Solar Cell -- Engineering Label-Constrained Shortest-Path Algorithms -- New Upper Bounds on Continuous Tree Edge-Partition Problem -- A Meeting Scheduling Problem Respecting Time and Space -- Fixed-Parameter Algorithms for Kemeny Scores -- The Distributed Wireless Gathering Problem -- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement -- An Improved Randomized Approximation Algorithm for Maximum Triangle Packing -- Line Facility Location in Weighted Regions -- Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems -- Engineering Comparators for Graph Clusterings -- On the Fast Searching Problem -- Confidently Cutting a Cake into Approximately Fair Pieces -- Copeland Voting Fully Resists Constructive Control -- The Complexity of Power-Index Comparison -- Facility Location Problems: A Parameterized View -- Shortest Path Queries in Polygonal Domains -- A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem -- Minimum Cost Homomorphism Dichotomy for Oriented Cycles -- Minimum Leaf Out-Branching Problems -- Graphs and Path Equilibria -- No l Grid-Points in Spaces of Small Dimension -- The Secret Santa Problem -- Finding Optimal Refueling Policies in Transportation Networks -- Scale Free Interval Graphs -- On Representation of Planar Graphs by Segments -- An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ? p Norm -- An Optimal Strategy for Online Non-uniform Length Order Scheduling -- Large-Scale Parallel Collaborative Filtering for the Netflix Prize. |
| Record Nr. | UNISA-996465280103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation [[electronic resource] ] : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings / / edited by Rudolf Fleischer, Gerhard Trippen
| Algorithms and Computation [[electronic resource] ] : 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings / / edited by Rudolf Fleischer, Gerhard Trippen |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVII, 935 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer science—Mathematics Numerical analysis Computer communication systems Computer graphics Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing Computer Communication Networks Computer Graphics |
| ISBN | 3-540-30551-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Puzzles, Art, and Magic with Algorithms -- The ABCs of AVDs: Geometric Retrieval Made Simple -- Pareto Optimality in House Allocation Problems -- Property-Preserving Data Reconstruction -- On the Monotone Circuit Complexity of Quadratic Boolean Functions -- Generalized Function Matching -- Approximate Distance Oracles for Graphs with Dense Clusters -- Multicriteria Global Minimum Cuts -- Polyline Fitting of Planar Points Under Min-sum Criteria -- A Generalization of Magic Squares with Applications to Digital Halftoning -- Voronoi Diagrams with a Transportation Network on the Euclidean Plane -- Structural Alignment of Two RNA Sequences with Lagrangian Relaxation -- Poly-APX- and PTAS-Completeness in Standard and Differential Approximation -- Efficient Algorithms for k Maximum Sums -- Equipartitions of Measures by 2-Fans -- Augmenting the Edge-Connectivity of a Spider Tree -- On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks -- Structural Similarity in Graphs -- Flexibility of Steiner Trees in Uniform Orientation Metrics -- Random Access to Advice Strings and Collapsing Results -- Bounding the Payment of Approximate Truthful Mechanisms -- The Polymatroid Steiner Problems -- Geometric Optimization Problems Over Sliding Windows -- On-Line Windows Scheduling of Temporary Items -- Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy -- An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem -- On the Range Maximum-Sum Segment Query Problem -- An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs -- Efficient Job Scheduling Algorithms with Multi-type Contentions -- Superimposing Voronoi Complexes for Shape Deformation -- On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem -- Guarding Art Galleries by Guarding Witnesses -- On p-Norm Based Locality Measures of Space-Filling Curves -- Composability of Infinite-State Activity Automata -- Error Compensation in Leaf Root Problems -- On Compact and Efficient Routing in Certain Graph Classes -- Randomized Insertion and Deletion in Point Quad Trees -- Diagnosis in the Presence of Intermittent Faults -- Three-Round Adaptive Diagnosis in Binary n-Cubes -- Fast Algorithms for Comparison of Similar Unordered Trees -- GCD of Random Linear Forms -- On the Hardness and Easiness of Random 4-SAT Formulas -- Minimum Common String Partition Problem: Hardness and Approximations -- On the Complexity of Network Synchronization -- Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs -- Adaptive Spatial Partitioning for Multidimensional Data Streams -- Paired Pointset Traversal -- Approximated Two Choices in Randomized Load Balancing -- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting -- Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs -- The Maximum Agreement of Two Nested Phylogenetic Networks -- Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations -- New Bounds on Map Labeling with Circular Labels -- Optimal Buffer Management via Resource Augmentation -- Oriented Paths in Mixed Graphs -- Polynomial Deterministic Rendezvous in Arbitrary Graphs -- Distributions of Points and Large Quadrangles -- Cutting Out Polygons with Lines and Rays -- Advantages of Backward Searching — Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays -- Inner Rectangular Drawings of Plane Graphs -- Approximating the Minmax Subtree Cover Problem in a Cactus -- Boundary-Optimal Triangulation Flooding -- Exact Computation of Polynomial Zeros Expressible by Square Roots -- Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements -- An O(nlog n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees -- Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks -- Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search -- Dynamic Tree Cross Products -- Spanners, Weak Spanners, and Power Spanners for Wireless Networks -- Techniques for Indexing and Querying Temporal Observations for a Collection of Objects -- Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices -- The Two-Guard Problem Revisited and Its Generalization -- Canonical Data Structure for Interval Probe Graphs -- Efficient Algorithms for the Longest Path Problem -- Randomized Algorithms for Motif Detection -- Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation -- Sweeping Graphs with Large Clique Number -- A Slightly Improved Sub-cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. |
| Record Nr. | UNISA-996466372603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms [[electronic resource] ] : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer
| Approximation and Online Algorithms [[electronic resource] ] : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 329 p. 42 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks Computer Graphics |
| ISBN | 3-319-89441-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph algorithms -- Inapproximability results -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Scheduling problems -- Algorithmic game theory -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications. |
| Record Nr. | UNISA-996466231403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Approximation and Online Algorithms : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer
| Approximation and Online Algorithms : 15th International Workshop, WAOA 2017, Vienna, Austria, September 7–8, 2017, Revised Selected Papers / / edited by Roberto Solis-Oba, Rudolf Fleischer |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 329 p. 42 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer networks Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Communication Networks Computer Graphics |
| ISBN | 3-319-89441-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph algorithms -- Inapproximability results -- Network design -- Packing and covering -- Paradigms for the design and analysis of approximation and online algorithms -- Parameterized complexity -- Scheduling problems -- Algorithmic game theory -- Coloring and partitioning -- Competitive analysis -- Computational advertising -- Computational finance -- Cuts and connectivity -- Geometric problems -- Mechanism design -- Resource augmentation -- Real-world applications. |
| Record Nr. | UNINA-9910349424403321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Experimental Algorithmics [[electronic resource] ] : From Algorithm Design to Robust and Efficient Software / / edited by Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt
| Experimental Algorithmics [[electronic resource] ] : From Algorithm Design to Robust and Efficient Software / / edited by Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XVIII, 286 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Data structures (Computer science) Algorithms Numerical analysis Computer science—Mathematics Computer Science, general Data Structures Algorithm Analysis and Problem Complexity Numeric Computing Discrete Mathematics in Computer Science |
| ISBN | 3-540-36383-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithm Engineering for Parallel Computation -- Visualization in Algorithm Engineering: Tools and Techniques -- Parameterized Complexity: The Main Ideas and Connections to Practical Computing -- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation -- Using Finite Experiments to Study Asymptotic Performance -- WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms -- Algorithms and Heuristics in VLSI Design -- Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics -- Presenting Data from Experiments in Algorithmics -- Distributed Algorithm Engineering -- Implementations and Experimental Studies of Dynamic Graph Algorithms. |
| Record Nr. | UNISA-996465746003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Experimental Algorithmics : From Algorithm Design to Robust and Efficient Software / / edited by Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt
| Experimental Algorithmics : From Algorithm Design to Robust and Efficient Software / / edited by Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XVIII, 286 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Data structures (Computer science) Algorithms Numerical analysis Computer science—Mathematics Computer Science, general Data Structures Algorithm Analysis and Problem Complexity Numeric Computing Discrete Mathematics in Computer Science |
| ISBN | 3-540-36383-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithm Engineering for Parallel Computation -- Visualization in Algorithm Engineering: Tools and Techniques -- Parameterized Complexity: The Main Ideas and Connections to Practical Computing -- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation -- Using Finite Experiments to Study Asymptotic Performance -- WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms -- Algorithms and Heuristics in VLSI Design -- Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics -- Presenting Data from Experiments in Algorithmics -- Distributed Algorithm Engineering -- Implementations and Experimental Studies of Dynamic Graph Algorithms. |
| Record Nr. | UNINA-9910143889403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Intelligent Cloud Computing [[electronic resource] ] : First International Conference, ICC 2014, Muscat, Oman, February 24-26, 2014, Revised Selected Papers / / edited by Asma Al-Saidi, Rudolf Fleischer, Zakaria Maamar, Omer F. Rana
| Intelligent Cloud Computing [[electronic resource] ] : First International Conference, ICC 2014, Muscat, Oman, February 24-26, 2014, Revised Selected Papers / / edited by Asma Al-Saidi, Rudolf Fleischer, Zakaria Maamar, Omer F. Rana |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (X, 169 p. 66 illus.) |
| Disciplina | 004 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer communication systems
Software engineering Application software Computer programming Algorithms Computer Communication Networks Software Engineering Information Systems Applications (incl. Internet) Programming Techniques Algorithm Analysis and Problem Complexity |
| ISBN | 3-319-19848-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cloud Computing: Towards Making Computing a Utility -- Semantic Engine and Cloud Agency for Vendor Agnostic Retrieval, Discovery, and Brokering of Cloud Services -- A Concurrency Mitigation Proposal for Sharing Environments: An Affinity Approach Based on Applications Classes -- On Cloud Spot Market: An Overview of the Research -- Analysis and Optimization on FlexDPDP: A Practical Solution for Dynamic Provable Data Possession -- Leveraging Ad-hoc Networking and Mobile Cloud Computing to Exploit Short-Lived Relationships Among Users on the Move -- Energy Consumption Analysis of HPC Applications Using NoSQL Database Feature of Energy Analyzer -- A Low-Overhead Secure Communication Framework for an Inter-cloud Environment -- Analysing Virtual Machine Security in Cloud Systems -- Cloud Computing: Security Issues Overview and Solving Techniques Investigation. |
| Record Nr. | UNISA-996198521703316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Intelligent Cloud Computing : First International Conference, ICC 2014, Muscat, Oman, February 24-26, 2014, Revised Selected Papers / / edited by Asma Al-Saidi, Rudolf Fleischer, Zakaria Maamar, Omer F. Rana
| Intelligent Cloud Computing : First International Conference, ICC 2014, Muscat, Oman, February 24-26, 2014, Revised Selected Papers / / edited by Asma Al-Saidi, Rudolf Fleischer, Zakaria Maamar, Omer F. Rana |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (X, 169 p. 66 illus.) |
| Disciplina | 004 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer communication systems
Software engineering Application software Computer programming Algorithms Computer Communication Networks Software Engineering Information Systems Applications (incl. Internet) Programming Techniques Algorithm Analysis and Problem Complexity |
| ISBN | 3-319-19848-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Cloud Computing: Towards Making Computing a Utility -- Semantic Engine and Cloud Agency for Vendor Agnostic Retrieval, Discovery, and Brokering of Cloud Services -- A Concurrency Mitigation Proposal for Sharing Environments: An Affinity Approach Based on Applications Classes -- On Cloud Spot Market: An Overview of the Research -- Analysis and Optimization on FlexDPDP: A Practical Solution for Dynamic Provable Data Possession -- Leveraging Ad-hoc Networking and Mobile Cloud Computing to Exploit Short-Lived Relationships Among Users on the Move -- Energy Consumption Analysis of HPC Applications Using NoSQL Database Feature of Energy Analyzer -- A Low-Overhead Secure Communication Framework for an Inter-cloud Environment -- Analysing Virtual Machine Security in Cloud Systems -- Cloud Computing: Security Issues Overview and Solving Techniques Investigation. |
| Record Nr. | UNINA-9910484956503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||