The Resource Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings, edited by My T. Thai, Sartaj Sahni, (electronic resource)

Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings, edited by My T. Thai, Sartaj Sahni, (electronic resource)

Label
Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings
Title
Computing and Combinatorics
Title remainder
16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings
Statement of responsibility
edited by My T. Thai, Sartaj Sahni
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Member of
Is Subseries of
http://bibfra.me/vocab/relation/corporateauthor
_EJ-7XLaJcE
Dewey number
511/.6
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • OXc9PfnyMmg
  • 6uLttDYaPYc
Image bit depth
0
Language note
English
LC call number
QA76.9.A43
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2010
http://bibfra.me/vocab/lite/meetingName
COCOON 2010
Nature of contents
dictionaries
http://bibfra.me/vocab/lite/organizationName
COCOON 2010
http://library.link/vocab/relatedWorkOrContributorName
  • COCOON 2010
  • Thai, My T.
  • Sahni, Sartaj.
Series statement
Theoretical Computer Science and General Issues
Series volume
6196
http://library.link/vocab/subjectName
  • Algorithms
  • Computer science—Mathematics
  • Computer communication systems
  • Computers
  • Computer graphics
  • Artificial intelligence
  • Algorithm Analysis and Problem Complexity
  • Discrete Mathematics in Computer Science
  • Computer Communication Networks
  • Computation by Abstract Devices
  • Computer Graphics
  • Artificial Intelligence
Label
Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings, edited by My T. Thai, Sartaj Sahni, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
Invited Talks -- Understanding and Inductive Inference -- Computing with Cells: Membrane Systems -- Complexity and Inapproximability -- Boxicity and Poset Dimension -- On the Hardness against Constant-Depth Linear-Size Circuits -- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model -- The Curse of Connectivity: t-Total Vertex (Edge) Cover -- Counting Paths in VPA Is Complete for #NC 1 -- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas -- Approximation Algorithms -- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing -- Clustering with or without the Approximation -- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks -- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars -- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs -- Graph Theory and Algorithms -- Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph -- Triangle-Free 2-Matchings Revisited -- The Cover Time of Deterministic Random Walks -- Finding Maximum Edge Bicliques in Convex Bipartite Graphs -- A Note on Vertex Cover in Graphs with Maximum Degree 3 -- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming -- Factorization of Cartesian Products of Hypergraphs -- Graph Drawing and Coloring -- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs -- On Three Parameters of Invisibility Graphs -- Imbalance Is Fixed Parameter Tractable -- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs -- Computational Geometry -- Optimal Binary Space Partitions in the Plane -- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems -- Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux -- Detecting Areas Visited Regularly -- Tile-Packing Tomography Is -hard -- The Rectilinear k-Bends TSP -- Tracking a Generator by Persistence -- Auspicious Tatami Mat Arrangements -- Automata, Logic, Algebra and Number Theory -- Faster Generation of Shorthand Universal Cycles for Permutations -- The Complexity of Word Circuits -- On the Density of Regular and Context-Free Languages -- Extensions of the Minimum Cost Homomorphism Problem -- The Longest Almost-Increasing Subsequence -- Universal Test Sets for Reversible Circuits -- Approximate Counting with a Floating-Point Counter -- Network Optimization and Scheduling Algorithm -- Broadcasting in Heterogeneous Tree Networks -- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks -- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties -- Computational Biology and Bioinformatics -- Discovering Pairwise Compatibility Graphs -- Near Optimal Solutions for Maximum Quasi-bicliques -- Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial -- Constant Time Approximation Scheme for Largest Well Predicted Subset -- On Sorting Permutations by Double-Cut-and-Joins -- A Three-String Approach to the Closest String Problem -- A 2k Kernel for the Cluster Editing Problem -- Data Structure and Sampling Theory -- On the Computation of 3D Visibility Skeletons -- The Violation Heap: A Relaxed Fibonacci-Like Heap -- Threshold Rules for Online Sample Selection -- Heterogeneous Subset Sampling -- Cryptography, Security, Coding and Game Theory -- Identity-Based Authenticated Asymmetric Group Key Agreement Protocol -- Zero-Knowledge Argument for Simultaneous Discrete Logarithms -- Directed Figure Codes: Decidability Frontier
Dimensions
unknown
Edition
1st ed.
Extent
1 online resource (553 p. 103 illus.)
File format
multiple file formats
Form of item
online
Isbn
9786613565488
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-642-14031-0
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)2670000000028933
  • (SSID)ssj0000446386
  • (PQKBManifestationID)11297670
  • (PQKBTitleCode)TC0000446386
  • (PQKBWorkID)10496066
  • (PQKB)10643613
  • (DE-He213)978-3-642-14031-0
  • (MiAaPQ)EBC3065479
  • (EXLCZ)992670000000028933
Label
Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings, edited by My T. Thai, Sartaj Sahni, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
Invited Talks -- Understanding and Inductive Inference -- Computing with Cells: Membrane Systems -- Complexity and Inapproximability -- Boxicity and Poset Dimension -- On the Hardness against Constant-Depth Linear-Size Circuits -- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model -- The Curse of Connectivity: t-Total Vertex (Edge) Cover -- Counting Paths in VPA Is Complete for #NC 1 -- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas -- Approximation Algorithms -- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing -- Clustering with or without the Approximation -- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks -- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars -- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs -- Graph Theory and Algorithms -- Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph -- Triangle-Free 2-Matchings Revisited -- The Cover Time of Deterministic Random Walks -- Finding Maximum Edge Bicliques in Convex Bipartite Graphs -- A Note on Vertex Cover in Graphs with Maximum Degree 3 -- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming -- Factorization of Cartesian Products of Hypergraphs -- Graph Drawing and Coloring -- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs -- On Three Parameters of Invisibility Graphs -- Imbalance Is Fixed Parameter Tractable -- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs -- Computational Geometry -- Optimal Binary Space Partitions in the Plane -- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems -- Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux -- Detecting Areas Visited Regularly -- Tile-Packing Tomography Is -hard -- The Rectilinear k-Bends TSP -- Tracking a Generator by Persistence -- Auspicious Tatami Mat Arrangements -- Automata, Logic, Algebra and Number Theory -- Faster Generation of Shorthand Universal Cycles for Permutations -- The Complexity of Word Circuits -- On the Density of Regular and Context-Free Languages -- Extensions of the Minimum Cost Homomorphism Problem -- The Longest Almost-Increasing Subsequence -- Universal Test Sets for Reversible Circuits -- Approximate Counting with a Floating-Point Counter -- Network Optimization and Scheduling Algorithm -- Broadcasting in Heterogeneous Tree Networks -- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks -- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties -- Computational Biology and Bioinformatics -- Discovering Pairwise Compatibility Graphs -- Near Optimal Solutions for Maximum Quasi-bicliques -- Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial -- Constant Time Approximation Scheme for Largest Well Predicted Subset -- On Sorting Permutations by Double-Cut-and-Joins -- A Three-String Approach to the Closest String Problem -- A 2k Kernel for the Cluster Editing Problem -- Data Structure and Sampling Theory -- On the Computation of 3D Visibility Skeletons -- The Violation Heap: A Relaxed Fibonacci-Like Heap -- Threshold Rules for Online Sample Selection -- Heterogeneous Subset Sampling -- Cryptography, Security, Coding and Game Theory -- Identity-Based Authenticated Asymmetric Group Key Agreement Protocol -- Zero-Knowledge Argument for Simultaneous Discrete Logarithms -- Directed Figure Codes: Decidability Frontier
Dimensions
unknown
Edition
1st ed.
Extent
1 online resource (553 p. 103 illus.)
File format
multiple file formats
Form of item
online
Isbn
9786613565488
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-642-14031-0
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)2670000000028933
  • (SSID)ssj0000446386
  • (PQKBManifestationID)11297670
  • (PQKBTitleCode)TC0000446386
  • (PQKBWorkID)10496066
  • (PQKB)10643613
  • (DE-He213)978-3-642-14031-0
  • (MiAaPQ)EBC3065479
  • (EXLCZ)992670000000028933

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...