skip to content
Theory and Applications of Models of Computation : 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings Preview this item
ClosePreview this item
Checking...

Theory and Applications of Models of Computation : 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings

Author: David HutchisonJianer ChenS Barry CooperTakeo KanadeJosef KittlerAll authors
Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
Series: SpringerLink: Springer e-Books; Lecture Notes in Computer Science, 5532.
Edition/Format:   eBook : EnglishView all editions and formats
Database:WorldCat
Summary:

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. This work addresses the  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Internet Resource
All Authors / Contributors: David Hutchison; Jianer Chen; S Barry Cooper; Takeo Kanade; Josef Kittler; Jon M Kleinberg; Friedemann Mattern; John C Mitchell; Moni Naor; Oscar Nierstrasz; C Pandu Rangan; Bernhard Steffen; Madhu Sudan; Demetri Terzopoulos; Doug Tygar; Moshe Y Vardi; Gerhard Weikum
ISBN: 9783642020179 3642020178 9783642020162 364202016X
OCLC Number: 728432111
Notes: Computer Science (Springer-11645).
Description: Online-Datei.
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.
Series Title: SpringerLink: Springer e-Books; Lecture Notes in Computer Science, 5532.
Responsibility: edited by David Hutchison, Takeo Kanade, Josef Kittler, Jon M. Kleinberg, Friedemann Mattern, John C. Mitchell, Moni Naor, Oscar Nierstrasz, C. Pandu Rangan, Bernhard Steffen, Madhu Sudan, Demetri Terzopoulos, Doug Tygar, Moshe Y. Vardi, Gerhard Weikum, Jianer Chen, S. Barry Cooper.
More information:

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/728432111>
library:oclcnum"728432111"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/728432111>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
<http://id.worldcat.org/fast/871991>
rdf:typeschema:Intangible
schema:name"Computational complexity"
schema:name"Computational complexity."
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:contributor
schema:creator
schema:datePublished"2009"
schema:exampleOfWork<http://worldcat.org/entity/work/id/349680872>
schema:inLanguage"en"
schema:name"Theory and Applications of Models of Computation 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings"
schema:publisher
schema:url
schema:url
schema:workExample
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.