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 and Computation [[electronic resource] ] : 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings / / edited by Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee
| Algorithms and Computation [[electronic resource] ] : 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings / / edited by Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XVII, 702 p. 117 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer networks Computer graphics Artificial intelligence—Data processing Numerical analysis Discrete Mathematics in Computer Science Computer Communication Networks Computer Graphics Data Science Numerical Analysis |
| ISBN | 3-642-35261-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph algorithms -- online and streaming algorithms -- combinatorial optimization -- computational complexity -- computational geometry -- string algorithms -- approximation algorithms -- graph drawing -- data structures -- randomized algorithms -- algorithmic game theory. |
| Record Nr. | UNISA-996466283903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computing and combinatorics : 12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006 : proceedings / / Danny Z. Chen, D.T. Lee (eds.)
| Computing and combinatorics : 12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006 : proceedings / / Danny Z. Chen, D.T. Lee (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XIV, 530 p.) |
| Disciplina | 004 |
| Altri autori (Persone) |
ChenDanny Z
LeeDer-Tsai |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer science
Combinatorial analysis |
| ISBN | 3-540-36926-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- The Unpredictable Deviousness of Models -- Security Issues in Collaborative Computing -- Session A -- A Simplicial Approach for Discrete Fixed Point Theorems -- On Incentive Compatible Competitive Selection Protocol -- Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands -- Aggregating Strategy for Online Auctions -- On Indecomposability Preserving Elimination Sequences -- Improved Algorithms for the Minmax Regret 1-Median Problem -- Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size -- Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs -- Varieties Generated by Certain Models of Reversible Finite Automata -- Iterated TGR Languages: Membership Problem and Effective Closure Properties -- On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences -- Robust Quantum Algorithms with ?-Biased Oracles -- The Complexity of Black-Box Ring Problems -- Lower Bounds and Parameterized Approach for Longest Common Subsequence -- Finding Patterns with Variable Length Gaps or Don’t Cares -- The Matrix Orthogonal Decomposition Problem in Intensity-Modulated Radiation Therapy -- A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem -- A PTAS for Cutting Out Polygons with Lines -- On Unfolding Lattice Polygons/Trees and Diameter-4 Trees -- Restricted Mesh Simplification Using Edge Contractions -- Enumerating Non-crossing Minimally Rigid Frameworks -- Sequences Characterizing k-Trees -- On the Threshold of Having a Linear Treewidth in Random Graphs -- Reconciling Gene Trees with Apparent Polytomies -- Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes -- Computing Maximum-Scoring Segments in Almost Linear Time -- Session B -- Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants -- A Detachment Algorithm for Inferring a Graph from Path Frequency -- The d-Identifying Codes Problem for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation Algorithm -- Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms -- On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis -- Improved On-Line Broadcast Scheduling with Deadlines -- A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast -- On Lazy Bin Covering and Packing Problems -- Creation and Growth of Components in a Random Hypergraph Process -- Optimal Acyclic Edge Colouring of Grid Like Graphs -- An Edge Ordering Problem of Regular Hypergraphs -- Efficient Partially Blind Signature Scheme with Provable Security -- A Rigorous Analysis for Set-Up Time Models – A Metric Perspective -- Geometric Representation of Graphs in Low Dimension -- The On-Line Heilbronn’s Triangle Problem in d Dimensions -- Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes -- Approximating Min-Max (Regret) Versions of Some Polynomial Problems -- The Class Constrained Bin Packing Problem with Applications to Video-on-Demand -- MAX-SNP Hardness and Approximation of Selected-Internal Steiner Trees -- Minimum Clique Partition Problem with Constrained Weight for Interval Graphs -- Overlap-Free Regular Languages -- On the Combinatorial Representation of Information -- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard -- Bimodal Crossing Minimization -- Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem -- On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem. |
| Altri titoli varianti | COCOON 2006 |
| Record Nr. | UNINA-9910484793103321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers in algorithmics : 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010 : proceedings / / Der-Tsai Lee, Danny Z. Chen, Shi Ying, (eds.)
| Frontiers in algorithmics : 4th International Workshop, FAW 2010, Wuhan, China, August 11-13, 2010 : proceedings / / Der-Tsai Lee, Danny Z. Chen, Shi Ying, (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XI, 339 p. 74 illus.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
LeeDer-Tsai
ChenDanny Z YingShi |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Computer algorithms |
| ISBN | 3-642-14553-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Progress on Certifying Algorithms -- Computational Geometry for Uncertain Data -- On Foundations of Services Interoperation in Cloud Computing -- Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets -- Truthful Auction for CPU Time Slots -- Top-d Rank Aggregation in Web Meta-search Engine -- Minimum Common String Partition Revisited -- Inapproximability of Maximal Strip Recovery: II -- Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy -- Approximation Schemes for Scheduling with Availability Constraints -- An Space Lower Bound for Finding ?-Approximate Quantiles in a Data Stream -- Improved Sublinear Time Algorithm for Width-Bounded Separators -- Constant Time Generation of Biconnected Rooted Plane Graphs -- Solving General Lattice Puzzles -- A Hybrid Graph Representation for Recursive Backtracking Algorithms -- On Tractable Exponential Sums -- Recognizing d-Interval Graphs and d-Track Interval Graphs -- Categorial Semantics of a Solution to Distributed Dining Philosophers Problem -- Approximation Algorithms for the Capacitated Domination Problem -- A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle -- FPTAS’s for Some Cut Problems in Weighted Trees -- Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks -- Online Algorithms for the Newsvendor Problem with and without Censored Demands -- O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems -- Path Separability of Graphs -- Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings -- Computing Minimum Diameter Color-Spanning Sets -- Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares -- Optimum Sweeps of Simple Polygons with Two Guards -- Adaptive Algorithms for Planar Convex Hull Problems -- New Algorithms for Barrier Coverage with Mobile Sensors. |
| Record Nr. | UNINA-9910484983903321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security
| Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2006 |
| Descrizione fisica | 1 online resource (384 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti |
Proceedings of the 2006 Association for Computing Machinery Symposium on Information, Computer and Communications Security
Asia CCS '06 ACM Symposium on Information, Computer and Communications Security 2006, Taipei, Taiwan - March 21 - 23, 2006 |
| Record Nr. | UNINA-9910376491403321 |
| [Place of publication not identified], : ACM, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||