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] ] : Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings / / edited by Siu-Wing Cheng, Chung Keung Poon
| Algorithmic Aspects in Information and Management [[electronic resource] ] : Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings / / edited by Siu-Wing Cheng, Chung Keung Poon |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XII, 504 p.) |
| Disciplina | 005.1 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer programming
Algorithms Data structures (Computer science) Computer science—Mathematics Numerical analysis Mathematical statistics Programming Techniques Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Numeric Computing Probability and Statistics in Computer Science |
| ISBN | 3-540-35158-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Further Reflections on a Theory for Basic Algorithms -- Algorithmic DNA Self-assembly -- Contributed Papers -- Online Scheduling on Parallel Machines with Two GoS Levels -- Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model -- Online Scheduling with Hard Deadlines on Parallel Machines -- Maximizing the Throughput of Multiple Machines On-Line -- Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set -- Linear Programming Polytope and Algorithm for Mean Payoff Games -- Atomic Routing Games on Maximum Congestion -- Equilibrium Distribution of Advertising Prices -- Finding Faithful Boyce-Codd Normal Form Decompositions -- Instant Service Policy and Its Application to Deficit Round Robin -- A Compression-Boosting Transform for Two-Dimensional Data -- Non-metric Multicommodity and Multilevel Facility Location -- Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem -- Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths -- Distributions of Points and Large Convex Hulls of k Points -- Throwing Stones Inside Simple Polygons -- Some Basics on Tolerances -- Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem -- Inverse Bottleneck Optimization Problems on Networks -- An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity -- Connected Set Cover Problem and Its Applications -- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth -- Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs -- A New Approach for Solving the Maximum Clique Problem -- The Approximability of the Exemplar Breakpoint Distance Problem -- Computing the ?-Seeds of a String -- Subsequence Packing: Complexity, Approximation, and Application -- Decomposition Based Heuristic Approach to Frequency Reassignment Problem -- Approximation Algorithms for Minimum Span Channel Assignment Problems -- Weighted Broadcast in Linear Radio Networks -- Secure Overlay Network Design -- A Portfolio Selection Method Based on Possibility Theory -- Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions -- Note on an Auction Procedure for a Matching Game in Polynomial Time. |
| Record Nr. | UNISA-996465738403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic aspects in information and management : second international conference, AAIM 2006, Hong Kong, China, June 20-22, 2006 : proceedings / / Siu-Wing Cheng, Chung Keung Poon (eds.)
| Algorithmic aspects in information and management : second international conference, AAIM 2006, Hong Kong, China, June 20-22, 2006 : proceedings / / Siu-Wing Cheng, Chung Keung Poon (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XII, 504 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
ChengSiu-Wing
PoonChung Keung |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 3, Information systems and application, incl. Internet/Web and HCI |
| Soggetto topico |
Computer algorithms
Management science - Mathematical models |
| ISBN | 3-540-35158-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Further Reflections on a Theory for Basic Algorithms -- Algorithmic DNA Self-assembly -- Contributed Papers -- Online Scheduling on Parallel Machines with Two GoS Levels -- Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model -- Online Scheduling with Hard Deadlines on Parallel Machines -- Maximizing the Throughput of Multiple Machines On-Line -- Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set -- Linear Programming Polytope and Algorithm for Mean Payoff Games -- Atomic Routing Games on Maximum Congestion -- Equilibrium Distribution of Advertising Prices -- Finding Faithful Boyce-Codd Normal Form Decompositions -- Instant Service Policy and Its Application to Deficit Round Robin -- A Compression-Boosting Transform for Two-Dimensional Data -- Non-metric Multicommodity and Multilevel Facility Location -- Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem -- Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths -- Distributions of Points and Large Convex Hulls of k Points -- Throwing Stones Inside Simple Polygons -- Some Basics on Tolerances -- Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem -- Inverse Bottleneck Optimization Problems on Networks -- An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity -- Connected Set Cover Problem and Its Applications -- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth -- Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs -- A New Approach for Solving the Maximum Clique Problem -- The Approximability of the Exemplar Breakpoint Distance Problem -- Computing the ?-Seeds of a String -- Subsequence Packing: Complexity, Approximation, and Application -- Decomposition Based Heuristic Approach to Frequency Reassignment Problem -- Approximation Algorithms for Minimum Span Channel Assignment Problems -- Weighted Broadcast in Linear Radio Networks -- Secure Overlay Network Design -- A Portfolio Selection Method Based on Possibility Theory -- Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions -- Note on an Auction Procedure for a Matching Game in Polynomial Time. |
| Altri titoli varianti | AAIM 2006 |
| Record Nr. | UNINA-9910484966103321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Computation [[electronic resource] ] : 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings / / edited by Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam
| Algorithms and Computation [[electronic resource] ] : 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings / / edited by Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 747 p. 145 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Artificial intelligence—Data processing Computer science Discrete Mathematics in Computer Science Computer Graphics Data Science Computer Science |
| ISBN | 3-642-45030-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk Paper -- Market Approach to Social Ads: The MyLikes Example and Related Problems -- Session 1A: Computational Geometry I -- Geodesic-Preserving Polygon Simplification -- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information -- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs -- Structure and Computation of Straight Skeletons in 3-Space -- Session 1B: Pattern Matching -- Pattern Matching with Non Overlapping Reversals – Approximation and On-line Algorithms -- Single and Multiple Consecutive Permutation Motif Search -- Beating O(nm) in Approximate LZW-Compressed Pattern Matching -- Less Space: Indexing for Queries with Wildcards -- Session 2A: Computational Complexity I -- On Determining Deep Holes of Generalized Reed-Solomon Codes -- Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes -- Determinantal Complexities and Field Extensions -- Session 2B: Internet and Social Network Algorithms I -- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs -- Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs -- The Complexity of Finding a Large Subgraph under Anonymity Constraints -- Session 3A: Graph Theory and Algorithms I -- On the Number of Edges of Fan-Crossing Free Graphs -- Cops and Robbers on Intersection Graphs -- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graph -- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs -- Session 3B: Scheduling Algorithms -- Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds -- Better Bounds for Online k-Frame Throughput Maximization in Network Switches -- The Solvable Cases of a Scheduling Algorithm -- Session 4A: Computational Complexity II -- Exact Sublinear Binomial Sampling -- Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas -- Dynamic Point Labeling is Strongly PSPACE-Complete -- Unsatisfiable CNF Formulas Contain Many Conflicts -- Session 4B: Computational Geometry II -- Pursuit Evasion on Polyhedral Surfaces -- Algorithms for Tolerated Tverberg Partitions -- Abstract Voronoi Diagrams with Disconnected Regions -- Terrain Visibility with Multiple Viewpoints -- Session 5A: Graph Theory and Algorithms II -- Exact Algorithms for Maximum Independent Set -- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs -- Testing Mutual Duality of Planar Graph -- Session 5B: Fixed-Parameter Tractable Algorithms -- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem -- Myhill-Nerode Methods for Hypergraphs -- Augmenting Graphs to Minimize the Diameter -- Session 6A: Algorithms and Data Structures I -- Top-k Document Retrieval in Compact Space and Near-Optimal Time -- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers -- Trajectory-Based Dynamic Map Labeling -- Session 6B: Internet and Social Network -- Algorithms II -- Asynchronous Rumor Spreading on Random Graphs -- Unit Cost Buyback Problem -- Faster Rumor Spreading with Multiple Calls -- Session 7A: Algorithmic Game Theory -- Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy -- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items -- New Results on the Online Pricing Problem -- Session 7B: Algorithms and Data Structures II -- RAM-Efficient External Memory Sorting -- Succinct Data Structures for Representing Equivalence Classes -- Sliding Bloom Filters -- Session 8A: Graph Theory and Algorithms III -- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs -- Bounded Representations of Interval and Proper Interval Graphs -- Detecting and Counting Small Pattern Graphs -- An O∗(1.1939n) Time Algorithm for Minimum Weighted Dominating Induced Matching -- Session 8B: Approximation Algorithms I -- New Inapproximability Bounds for TSP -- Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise -- Tight Approximation Bounds for Connectivity with a Color-Spanning Set -- The Train Delivery Problem Revisited -- Session 9A: Computational Geometry III -- The Distance 4-Sector of Two Points Is Unique -- The Number of Different Unfoldings of Polyhedra -- Computing the Smallest Color-Spanning Axis-Parallel Square -- Session 9B: Approximation Algorithms II -- Euclidean Traveling Salesman Tours through Stochastic Neighborhoods -- Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure -- Approximate ˇCech Complex in Low and High Dimensions -- Session 10A: Computational Complexity III -- Model Counting for Formulas of Bounded Clique- Width -- Computing Plurality Points and Condorcet Points in Euclidean Space -- Computing Minimum Tile Sets to Self-assemble Color Patterns -- Session 10B: Network Algorithms -- A Probabilistic Analysis of Kademlia Networks -- Approximating the Generalized Minimum Manhattan Network Problem -- Minmax Regret 1-Facility Location on Uncertain Path Networks. |
| Record Nr. | UNISA-996465647903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Computation : 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings / / edited by Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam
| Algorithms and Computation : 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings / / edited by Leizhen Cai, Siu-Wing Cheng, Tak-Wah Lam |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 747 p. 145 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer graphics Artificial intelligence—Data processing Computer science Discrete Mathematics in Computer Science Computer Graphics Data Science Computer Science |
| ISBN | 3-642-45030-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk Paper -- Market Approach to Social Ads: The MyLikes Example and Related Problems -- Session 1A: Computational Geometry I -- Geodesic-Preserving Polygon Simplification -- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information -- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs -- Structure and Computation of Straight Skeletons in 3-Space -- Session 1B: Pattern Matching -- Pattern Matching with Non Overlapping Reversals – Approximation and On-line Algorithms -- Single and Multiple Consecutive Permutation Motif Search -- Beating O(nm) in Approximate LZW-Compressed Pattern Matching -- Less Space: Indexing for Queries with Wildcards -- Session 2A: Computational Complexity I -- On Determining Deep Holes of Generalized Reed-Solomon Codes -- Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes -- Determinantal Complexities and Field Extensions -- Session 2B: Internet and Social Network Algorithms I -- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs -- Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs -- The Complexity of Finding a Large Subgraph under Anonymity Constraints -- Session 3A: Graph Theory and Algorithms I -- On the Number of Edges of Fan-Crossing Free Graphs -- Cops and Robbers on Intersection Graphs -- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graph -- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs -- Session 3B: Scheduling Algorithms -- Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds -- Better Bounds for Online k-Frame Throughput Maximization in Network Switches -- The Solvable Cases of a Scheduling Algorithm -- Session 4A: Computational Complexity II -- Exact Sublinear Binomial Sampling -- Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas -- Dynamic Point Labeling is Strongly PSPACE-Complete -- Unsatisfiable CNF Formulas Contain Many Conflicts -- Session 4B: Computational Geometry II -- Pursuit Evasion on Polyhedral Surfaces -- Algorithms for Tolerated Tverberg Partitions -- Abstract Voronoi Diagrams with Disconnected Regions -- Terrain Visibility with Multiple Viewpoints -- Session 5A: Graph Theory and Algorithms II -- Exact Algorithms for Maximum Independent Set -- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs -- Testing Mutual Duality of Planar Graph -- Session 5B: Fixed-Parameter Tractable Algorithms -- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem -- Myhill-Nerode Methods for Hypergraphs -- Augmenting Graphs to Minimize the Diameter -- Session 6A: Algorithms and Data Structures I -- Top-k Document Retrieval in Compact Space and Near-Optimal Time -- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers -- Trajectory-Based Dynamic Map Labeling -- Session 6B: Internet and Social Network -- Algorithms II -- Asynchronous Rumor Spreading on Random Graphs -- Unit Cost Buyback Problem -- Faster Rumor Spreading with Multiple Calls -- Session 7A: Algorithmic Game Theory -- Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy -- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items -- New Results on the Online Pricing Problem -- Session 7B: Algorithms and Data Structures II -- RAM-Efficient External Memory Sorting -- Succinct Data Structures for Representing Equivalence Classes -- Sliding Bloom Filters -- Session 8A: Graph Theory and Algorithms III -- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs -- Bounded Representations of Interval and Proper Interval Graphs -- Detecting and Counting Small Pattern Graphs -- An O∗(1.1939n) Time Algorithm for Minimum Weighted Dominating Induced Matching -- Session 8B: Approximation Algorithms I -- New Inapproximability Bounds for TSP -- Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise -- Tight Approximation Bounds for Connectivity with a Color-Spanning Set -- The Train Delivery Problem Revisited -- Session 9A: Computational Geometry III -- The Distance 4-Sector of Two Points Is Unique -- The Number of Different Unfoldings of Polyhedra -- Computing the Smallest Color-Spanning Axis-Parallel Square -- Session 9B: Approximation Algorithms II -- Euclidean Traveling Salesman Tours through Stochastic Neighborhoods -- Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure -- Approximate ˇCech Complex in Low and High Dimensions -- Session 10A: Computational Complexity III -- Model Counting for Formulas of Bounded Clique- Width -- Computing Plurality Points and Condorcet Points in Euclidean Space -- Computing Minimum Tile Sets to Self-assemble Color Patterns -- Session 10B: Network Algorithms -- A Probabilistic Analysis of Kademlia Networks -- Approximating the Generalized Minimum Manhattan Network Problem -- Minmax Regret 1-Facility Location on Uncertain Path Networks. |
| Record Nr. | UNINA-9910483250503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the sixteenth annual Symposium on Computational Geometry
| Proceedings of the sixteenth annual Symposium on Computational Geometry |
| Autore | Cheng Siu-Wing |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2000 |
| Descrizione fisica | 1 online resource (379 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Mathematics
Physical Sciences & Mathematics Geometry |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | SoCG 2000 the 16th annual ACM Symposium on Computational Geometry, Clear Water Bay, Hong Kong - June 12 - 14, 2000 |
| Record Nr. | UNINA-9910376217203321 |
Cheng Siu-Wing
|
||
| [Place of publication not identified], : ACM, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||