Coverart for item
The Resource Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 18-22, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)

Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 18-22, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)

Label
Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 18-22, 2009 : proceedings
Title
Theory and applications of models of computation
Title remainder
6th international conference, TAMC 2009, Changsha, China, May 18-22, 2009 : proceedings
Statement of responsibility
Jianer Chen, S. Barry Cooper (eds.)
Title variation
  • Models of computation
  • TAMC 2009
Creator
Contributor
Subject
Genre
Language
eng
Summary
This book constitutes the refereed proceedings of the 6th International Conference on Theory and Applications of Models of Computation, TAMC 2009, held in Changsha, China in May 2009. The 39 full papers presented together with 7 invited papers as well as 3 plenary talks were selected from 86 submissions. The papers address the three main themes of the conference which were Computability, Complexity, and Algorithms. The conference aimed to bring together researchers with interests in theoretical computer science, algorithmic mathematics, and applications to the physical sciences
Member of
Cataloging source
GW5XE
Dewey number
004.0151
Illustrations
illustrations
Index
index present
LC call number
QA267.7
LC item number
.T36 2009
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2009
http://bibfra.me/vocab/lite/meetingName
TAMC (Conference)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Chen, Jianer
  • Cooper, S. B.
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary: SL 1-- Theoretical computer science and general issues
Series volume
5532
http://library.link/vocab/subjectName
  • Computational complexity
  • Computable functions
  • Informatique
  • Computable functions
  • Computational complexity
Label
Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 18-22, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)
Instantiates
Publication
Note
Title from title screen (viewed August 14, 2009)
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Plenary Talks -- Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks -- Constraints, Graphs, Algebra, Logic, and Complexity -- Distributed Systems and Their Environments -- Invited Special Session: Models of Computation -- Co-evolution and Information Signals in Biological Sequences -- The Extended Turing Model as Contextual Tool -- Strong Positive Reducibilities -- Invited Special Session: Algorithms and Complexity -- Fixed-Parameter Algorithms for Graph-Modeled Date Clustering -- On Spanners of Geometric Graphs -- Searching Trees: An Essay -- Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems -- Contributed Papers -- A Quadratic Kernel for 3-Set Packing -- Quantitative Aspects of Speed-Up and Gap Phenomena -- Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG -- On the Connection between Interval Size Functions and Path Counting -- On the Red/Blue Spanning Tree Problem -- Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata -- A Computational Proof of Complexity of Some Restricted Counting Problems -- Block-Graph Width -- Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs -- On Parameterized Exponential Time Complexity -- Best-Order Streaming Model -- Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces -- Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data -- Improved Deterministic Algorithms for Weighted Matching and Packing Problems -- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover -- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability -- A Complete Characterisation of the Linear Clique-Width of Path Powers -- Preserving Privacy versus Data Retention -- Kolmogorov Complexity and Combinatorial Methods in Communication Complexity -- An Almost Totally Universal Tile Set -- Linear Kernel for Planar Connected Dominating Set -- A Simple Greedy Algorithm for the k-Disjoint Flow Problem -- Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions -- Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code -- Terminal Coalgebras for Measure-Polynomial Functors -- High Minimal Pairs in the Enumeration Degrees -- Searching a Circular Corridor with Two Flashlights -- On the Complexity of the Multiple Stack TSP, kSTSP -- Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments -- An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues -- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem -- On the Tractability of Maximal Strip Recovery -- Greedy Local Search and Vertex Cover in Sparse Random Graphs -- Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms -- Feasibility of Motion Planning on Directed Graphs -- Polynomial-Time Algorithm for Sorting by Generalized Translocations -- The Two-Guard Polygon Walk Problem -- Approximation and Hardness Results for Label Cut and Related Problems -- An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
Control code
424511615
Dimensions
unknown
Extent
1 online resource (xiv, 482 pages)
Form of item
online
Isbn
9783642020179
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-02016-2
Specific material designation
remote
System control number
(OCoLC)424511615
Label
Theory and applications of models of computation : 6th international conference, TAMC 2009, Changsha, China, May 18-22, 2009 : proceedings, Jianer Chen, S. Barry Cooper (eds.)
Publication
Note
Title from title screen (viewed August 14, 2009)
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Plenary Talks -- Neural Computations That Support Long Mixed Sequences of Knowledge Acquisition Tasks -- Constraints, Graphs, Algebra, Logic, and Complexity -- Distributed Systems and Their Environments -- Invited Special Session: Models of Computation -- Co-evolution and Information Signals in Biological Sequences -- The Extended Turing Model as Contextual Tool -- Strong Positive Reducibilities -- Invited Special Session: Algorithms and Complexity -- Fixed-Parameter Algorithms for Graph-Modeled Date Clustering -- On Spanners of Geometric Graphs -- Searching Trees: An Essay -- Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems -- Contributed Papers -- A Quadratic Kernel for 3-Set Packing -- Quantitative Aspects of Speed-Up and Gap Phenomena -- Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG -- On the Connection between Interval Size Functions and Path Counting -- On the Red/Blue Spanning Tree Problem -- Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata -- A Computational Proof of Complexity of Some Restricted Counting Problems -- Block-Graph Width -- Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs -- On Parameterized Exponential Time Complexity -- Best-Order Streaming Model -- Behavioral and Logical Equivalence of Stochastic Kripke Models in General Measurable Spaces -- Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data -- Improved Deterministic Algorithms for Weighted Matching and Packing Problems -- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover -- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability -- A Complete Characterisation of the Linear Clique-Width of Path Powers -- Preserving Privacy versus Data Retention -- Kolmogorov Complexity and Combinatorial Methods in Communication Complexity -- An Almost Totally Universal Tile Set -- Linear Kernel for Planar Connected Dominating Set -- A Simple Greedy Algorithm for the k-Disjoint Flow Problem -- Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions -- Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code -- Terminal Coalgebras for Measure-Polynomial Functors -- High Minimal Pairs in the Enumeration Degrees -- Searching a Circular Corridor with Two Flashlights -- On the Complexity of the Multiple Stack TSP, kSTSP -- Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments -- An Online Algorithm for Applying Reinforcement Learning to Handle Ambiguity in Spoken Dialogues -- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem -- On the Tractability of Maximal Strip Recovery -- Greedy Local Search and Vertex Cover in Sparse Random Graphs -- Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms -- Feasibility of Motion Planning on Directed Graphs -- Polynomial-Time Algorithm for Sorting by Generalized Translocations -- The Two-Guard Polygon Walk Problem -- Approximation and Hardness Results for Label Cut and Related Problems -- An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge
Control code
424511615
Dimensions
unknown
Extent
1 online resource (xiv, 482 pages)
Form of item
online
Isbn
9783642020179
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-02016-2
Specific material designation
remote
System control number
(OCoLC)424511615

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...