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.

Biblioteca

MARC Lista (tabellare)
Algorithms and Models for the Web-Graph [[electronic resource] ] : 6th International Workshop, WAW 2009 Barcelona, Spain, February 12-13, 2009, Proceedings / / edited by Konstantin Avratchenkov, Debora Donato, Nelly Litvak
Algorithms and Models for the Web-Graph [[electronic resource] ] : 6th International Workshop, WAW 2009 Barcelona, Spain, February 12-13, 2009, Proceedings / / edited by Konstantin Avratchenkov, Debora Donato, Nelly Litvak
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (X, 185 p.)
Disciplina 006.3/12
Collana Theoretical Computer Science and General Issues
Soggetto topico Algorithms
Computer science—Mathematics
Discrete mathematics
Application software
Data mining
Computer networks
Database management
Discrete Mathematics in Computer Science
Computer and Information Systems Applications
Data Mining and Knowledge Discovery
Computer Communication Networks
Database Management
ISBN 3-540-95995-5
Classificazione DAT 537f
DAT 616f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph Models for Complex Networks -- Information Theoretic Comparison of Stochastic Graph Models: Some Experiments -- Approximating the Number of Network Motifs -- Finding Dense Subgraphs with Size Bounds -- The Giant Component in a Random Subgraph of a Given Graph -- Quantifying the Impact of Information Aggregation on Complex Networks: A Temporal Perspective -- PageRank and Web Graph -- A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank -- Choose the Damping, Choose the Ranking? -- Characterization of Tail Dependence for In-Degree and PageRank -- Web Page Rank Prediction with PCA and EM Clustering -- Permuting Web Graphs -- Social Networks and Search -- A Dynamic Model for On-Line Social Networks -- TC-SocialRank: Ranking the Social Web -- Exploiting Positive and Negative Graded Relevance Assessments for Content Recommendation -- Cluster Based Personalized Search.
Record Nr. UNISA-996465716203316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms and models for the web-graph : 6th international workshop, WAW 2009, Barcelona, Spain, February 12-13, 2009m proceedings / / Konstantin Avrachenkov, Debora Donato, Nelly Litvak (Eds.)
Algorithms and models for the web-graph : 6th international workshop, WAW 2009, Barcelona, Spain, February 12-13, 2009m proceedings / / Konstantin Avrachenkov, Debora Donato, Nelly Litvak (Eds.)
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin ; ; Heidelberg, : Springer-Verlag, 2009
Descrizione fisica 1 online resource (X, 185 p.)
Disciplina 006.3/12
Altri autori (Persone) AvrachenkovKonstantin
DonatoDebora
LitvakNelly
Collana Lecture Notes in Computer Science
Soggetto topico Computer algorithms
Data mining
ISBN 3-540-95995-5
Classificazione DAT 537f
DAT 616f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph Models for Complex Networks -- Information Theoretic Comparison of Stochastic Graph Models: Some Experiments -- Approximating the Number of Network Motifs -- Finding Dense Subgraphs with Size Bounds -- The Giant Component in a Random Subgraph of a Given Graph -- Quantifying the Impact of Information Aggregation on Complex Networks: A Temporal Perspective -- PageRank and Web Graph -- A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank -- Choose the Damping, Choose the Ranking? -- Characterization of Tail Dependence for In-Degree and PageRank -- Web Page Rank Prediction with PCA and EM Clustering -- Permuting Web Graphs -- Social Networks and Search -- A Dynamic Model for On-Line Social Networks -- TC-SocialRank: Ranking the Social Web -- Exploiting Positive and Negative Graded Relevance Assessments for Content Recommendation -- Cluster Based Personalized Search.
Record Nr. UNINA-9910483457803321
Berlin ; ; Heidelberg, : Springer-Verlag, 2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009 : proceedings / / Irit Dinur ... [et al.] (eds.)
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009 : proceedings / / Irit Dinur ... [et al.] (eds.)
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin ; ; New York, : Springer, c2009
Descrizione fisica 1 online resource (XII, 742 p. 41 illus.)
Disciplina 005.11
Altri autori (Persone) DinurIrit
Collana Lecture notes in computer science
Soggetto topico Computer algorithms
Computer science - Statistical methods
ISBN 3-642-03685-6
Classificazione DAT 517f
DAT 537f
MAT 410f
MAT 913f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Contributed Talks of APPROX -- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs -- Adaptive Sampling for k-Means Clustering -- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs -- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs -- Truthful Mechanisms via Greedy Iterative Packing -- Resource Minimization Job Scheduling -- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders -- New Hardness Results for Diophantine Approximation -- PASS Approximation -- Optimal Sherali-Adams Gaps from Pairwise Independence -- An Approximation Scheme for Terrain Guarding -- Scheduling with Outliers -- Improved Inapproximability Results for Maximum k-Colorable Subgraph -- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems -- On the Optimality of Gluing over Scales -- On Hardness of Pricing Items for Single-Minded Bidders -- Real-Time Message Routing and Scheduling -- Approximating Some Network Design Problems with Node Costs -- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties -- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy -- Minimizing Average Shortest Path Distances via Shortcut Edge Addition -- Approximating Node-Connectivity Augmentation Problems -- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs -- On the Complexity of the Asymmetric VPN Problem -- Contributed Talks of RANDOM -- Deterministic Approximation Algorithms for the Nearest Codeword Problem -- Strong Parallel Repetition Theorem for Free Projection Games -- Random Low Degree Polynomials are Hard to Approximate -- Composition of Semi-LTCs by Two-Wise Tensor Products -- On the Security of Goldreich’s One-Way Function -- Random Tensors and Planted Cliques -- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry -- Average-Case Analyses of Vickrey Costs -- A Hypergraph Dictatorship Test with Perfect Completeness -- Extractors Using Hardness Amplification -- How Well Do Random Walks Parallelize? -- An Analysis of Random-Walk Cuckoo Hashing -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Succinct Representation of Codes with Applications to Testing -- Efficient Quantum Tensor Product Expanders and k-Designs -- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND -- Pseudorandom Generators and Typically-Correct Derandomization -- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions -- Tolerant Linearity Testing and Locally Testable Codes -- Pseudorandom Bit Generators That Fool Modular Sums -- The Glauber Dynamics for Colourings of Bounded Degree Trees -- Testing ±1-weight halfspace -- Small-Bias Spaces for Group Products -- Small Clique Detection and Approximate Nash Equilibria -- Testing Computability by Width Two OBDDs -- Improved Polynomial Identity Testing for Read-Once Formulas -- Smooth Analysis of the Condition Number and the Least Singular Value.
Altri titoli varianti APPROX 2009
RANDOM 2009
Record Nr. UNINA-9910484414603321
Berlin ; ; New York, : Springer, c2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings / / edited by Irit Dinur, Klaus Jansen, Seffi Naor, José Rolim
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XII, 742 p. 41 illus.)
Disciplina 005.11
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Algorithms
Computer science—Mathematics
Discrete mathematics
Numerical analysis
Mathematical statistics
Programming Techniques
Discrete Mathematics in Computer Science
Numerical Analysis
Symbolic and Algebraic Manipulation
Probability and Statistics in Computer Science
ISBN 3-642-03685-6
Classificazione DAT 517f
DAT 537f
MAT 410f
MAT 913f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Contributed Talks of APPROX -- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs -- Adaptive Sampling for k-Means Clustering -- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs -- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs -- Truthful Mechanisms via Greedy Iterative Packing -- Resource Minimization Job Scheduling -- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders -- New Hardness Results for Diophantine Approximation -- PASS Approximation -- Optimal Sherali-Adams Gaps from Pairwise Independence -- An Approximation Scheme for Terrain Guarding -- Scheduling with Outliers -- Improved Inapproximability Results for Maximum k-Colorable Subgraph -- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems -- On the Optimality of Gluing over Scales -- On Hardness of Pricing Items for Single-Minded Bidders -- Real-Time Message Routing and Scheduling -- Approximating Some Network Design Problems with Node Costs -- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties -- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy -- Minimizing Average Shortest Path Distances via Shortcut Edge Addition -- Approximating Node-Connectivity Augmentation Problems -- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs -- On the Complexity of the Asymmetric VPN Problem -- Contributed Talks of RANDOM -- Deterministic Approximation Algorithms for the Nearest Codeword Problem -- Strong Parallel Repetition Theorem for Free Projection Games -- Random Low Degree Polynomials are Hard to Approximate -- Composition of Semi-LTCs by Two-Wise Tensor Products -- On the Security of Goldreich’s One-Way Function -- Random Tensors and Planted Cliques -- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry -- Average-Case Analyses of Vickrey Costs -- A Hypergraph Dictatorship Test with Perfect Completeness -- Extractors Using Hardness Amplification -- How Well Do Random Walks Parallelize? -- An Analysis of Random-Walk Cuckoo Hashing -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Succinct Representation of Codes with Applications to Testing -- Efficient Quantum Tensor Product Expanders and k-Designs -- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND -- Pseudorandom Generators and Typically-Correct Derandomization -- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions -- Tolerant Linearity Testing and Locally Testable Codes -- Pseudorandom Bit Generators That Fool Modular Sums -- The Glauber Dynamics for Colourings of Bounded Degree Trees -- Testing ±1-weight halfspace -- Small-Bias Spaces for Group Products -- Small Clique Detection and Approximate Nash Equilibria -- Testing Computability by Width Two OBDDs -- Improved Polynomial Identity Testing for Read-Once Formulas -- Smooth Analysis of the Condition Number and the Least Singular Value.
Record Nr. UNISA-996465733103316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorial Pattern Matching [[electronic resource] ] : 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings / / edited by Gregory Kucherov, Esko Ukkonen
Combinatorial Pattern Matching [[electronic resource] ] : 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings / / edited by Gregory Kucherov, Esko Ukkonen
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Descrizione fisica 1 online resource (XIII, 370 p.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Pattern recognition systems
Bioinformatics
Algorithms
Artificial intelligence—Data processing
Information storage and retrieval systems
Theory of Computation
Automated Pattern Recognition
Computational and Systems Biology
Data Science
Information Storage and Retrieval
ISBN 3-642-02441-6
Classificazione DAT 537f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).
Record Nr. UNISA-996465843503316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Combinatorial pattern matching : 20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings / / Gregory Kucherov, Esko Ukkonen (eds.)
Combinatorial pattern matching : 20th annual symposium, CPM 2009, Lille, France, June 22-24, 2009 : proceedings / / Gregory Kucherov, Esko Ukkonen (eds.)
Edizione [1st ed. 2009.]
Pubbl/distr/stampa Berlin ; ; New York, : Springer, c2009
Descrizione fisica 1 online resource (XIII, 370 p.)
Disciplina 004.0151
Altri autori (Persone) KucherovGregory
UkkonenE <1950-> (Esko)
Collana Lecture notes in computer science
Soggetto topico Computer algorithms
Combinatorial analysis
ISBN 3-642-02441-6
Classificazione DAT 537f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).
Altri titoli varianti CPM 2004
Record Nr. UNINA-9910483950803321
Berlin ; ; New York, : Springer, c2009
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Descrizione fisica 1 online resource (XII, 237 p.)
Disciplina 511/.5
Collana Image Processing, Computer Vision, Pattern Recognition, and Graphics
Soggetto topico Geometry - Data processing
Graph theory - Data processing
ISBN 3-540-89550-7
Classificazione DAT 537f
MAT 052f
MAT 055f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Dudeney Transformation of Normal Tiles -- Chromatic Numbers of Specified Isohedral Tilings -- Transforming Graphs with the Same Degree Sequence -- The Forest Number of (n,m)-Graphs -- Computing Simple Paths on Points in Simple Polygons -- Deflating the Pentagon -- Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry -- Solvable Trees -- Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle -- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets -- Fast Skew Partition Recognition -- Some Results on Fractional Graph Theory -- Seven Types of Random Spherical Triangle in S n and Their Probabilities -- (3,2)-Track Layout of Bipartite Graph Subdivisions -- Bartholdi Zeta Functions of Branched Coverings of Digraphs -- On Super Edge-Magic Strength and Deficiency of Graphs -- The Number of Flips Required to Obtain Non-crossing Convex Cycles -- Divide and Conquer Method for k-Set Polygons -- Coloring Axis-Parallel Rectangles -- Domination in Cubic Graphs of Large Girth -- Chvátal–Erd?s Theorem: Old Theorem with New Aspects -- Computer-Aided Creation of Impossible Objects and Impossible Motions -- The Hamiltonian Number of Cubic Graphs -- SUDOKU Colorings of the Hexagonal Bipyramid Fractal.
Record Nr. UNINA-9910483671203321
Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
Computational geometry and graph theory : international conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007, revised selected papers / / edited by Hiro Ito [and three others]
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Descrizione fisica 1 online resource (XII, 237 p.)
Disciplina 511/.5
Collana Image Processing, Computer Vision, Pattern Recognition, and Graphics
Soggetto topico Geometry - Data processing
Graph theory - Data processing
ISBN 3-540-89550-7
Classificazione DAT 537f
MAT 052f
MAT 055f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Dudeney Transformation of Normal Tiles -- Chromatic Numbers of Specified Isohedral Tilings -- Transforming Graphs with the Same Degree Sequence -- The Forest Number of (n,m)-Graphs -- Computing Simple Paths on Points in Simple Polygons -- Deflating the Pentagon -- Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry -- Solvable Trees -- Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle -- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets -- Fast Skew Partition Recognition -- Some Results on Fractional Graph Theory -- Seven Types of Random Spherical Triangle in S n and Their Probabilities -- (3,2)-Track Layout of Bipartite Graph Subdivisions -- Bartholdi Zeta Functions of Branched Coverings of Digraphs -- On Super Edge-Magic Strength and Deficiency of Graphs -- The Number of Flips Required to Obtain Non-crossing Convex Cycles -- Divide and Conquer Method for k-Set Polygons -- Coloring Axis-Parallel Rectangles -- Domination in Cubic Graphs of Large Girth -- Chvátal–Erd?s Theorem: Old Theorem with New Aspects -- Computer-Aided Creation of Impossible Objects and Impossible Motions -- The Hamiltonian Number of Cubic Graphs -- SUDOKU Colorings of the Hexagonal Bipyramid Fractal.
Record Nr. UNISA-996465425303316
Berlin, Germany ; ; New York, New York : , : Springer, , [2008]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computing and Combinatorics [[electronic resource] ] : 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings / / edited by Xiaodong Hu, Jie Wang
Computing and Combinatorics [[electronic resource] ] : 14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings / / edited by Xiaodong Hu, Jie Wang
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica 1 online resource (XIV, 680 p.)
Disciplina 004.0151
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer programming
Computer networks
Algorithms
Computer science—Mathematics
Discrete mathematics
Artificial intelligence—Data processing
Computer graphics
Programming Techniques
Computer Communication Networks
Discrete Mathematics in Computer Science
Data Science
Computer Graphics
ISBN 3-540-69733-0
Classificazione DAT 500f
DAT 537f
MAT 050f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics – Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics – Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries.
Record Nr. UNISA-996465846303316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computing and combinatorics : 14th annual international conference, COCOON 2008 Dalian, China, June 27-29, 2008 : proceedings / / Xiaodong Hu, Jie Wang (eds)
Computing and combinatorics : 14th annual international conference, COCOON 2008 Dalian, China, June 27-29, 2008 : proceedings / / Xiaodong Hu, Jie Wang (eds)
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, : Springer, 2008
Descrizione fisica 1 online resource (XIV, 680 p.)
Disciplina 004.0151
Altri autori (Persone) HuXiaodong
WangJie
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-69733-0
Classificazione DAT 500f
DAT 537f
MAT 050f
SS 4800
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics – Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics – Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries.
Altri titoli varianti COCOON 2008
Record Nr. UNINA-9910483048903321
Berlin, : Springer, 2008
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui