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.
Theory and Applications of Models of Computation [[electronic resource] ] : 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Hong Zhu
| Theory and Applications of Models of Computation [[electronic resource] ] : 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Hong Zhu |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (783 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Artificial intelligence Computer science—Mathematics Bioinformatics Theory of Computation Artificial Intelligence Mathematics of Computing |
| ISBN |
1-280-95658-5
9786610956586 3-540-72504-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Lectures -- Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm -- Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures -- Contributed Papers -- Approximation Algorithms for 3D Orthogonal Knapsack -- A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences -- The Hardness of Selective Network Design for Bottleneck Routing Games -- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns -- Elementary Differences Among Jump Hierarchies -- Working with the LR Degrees -- Computability on Subsets of Locally Compact Spaces -- A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs -- Finding a Duplicate and a Missing Item in a Stream -- Directed Searching Digraphs: Monotonicity and Complexity -- Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem -- Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing -- A Provably Secure Blind Signature Scheme -- Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2) -- New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems -- The Strongest Nonsplitting Theorem -- There is an Sw-Cuppable Strongly c.e. Real -- On Computation Complexity of the Concurrently Enabled Transition Set Problem -- Synchronization of Some DFA -- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs -- On Exact Complexity of Subgraph Homeomorphism -- Searching a Polygonal Region by Two Guards -- On the Internal Steiner Tree Problem -- Approximately Optimal Trees for Group Key Management with Batch Updates -- On Deciding Deep Holes of Reed-Solomon Codes -- Quantum Multiparty Communication Complexity and Circuit Lower Bounds -- Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions -- Improving the Average Delay of Sorting -- Approximating Capacitated Tree-Routings in Networks -- Feedback Arc Set Problem in Bipartite Tournaments -- Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc Network -- Enhancing Simulation for Checking Language Containment -- QBF-Based Symbolic Model Checking for Knowledge and Time -- A Characterization of the Language Classes Learnable with Correction Queries -- Learnable Algorithm on the Continuum -- Online Deadline Scheduling with Bounded Energy Efficiency -- Efficient Algorithms for Airline Problem -- Efficient Exact Arithmetic over Constructive Reals -- Bounding Run-Times of Local Adiabatic Algorithms -- A Note on Universal Composable Zero Knowledge in Common Reference String Model -- A Note on the Feasibility of Generalized Universal Composability -- t-Private and Secure Auctions -- Secure Multiparty Computations Using a Dial Lock -- A Time Hierarchy Theorem for Nondeterministic Cellular Automata -- Decidability of Propositional Projection Temporal Logic with Infinite Models -- Separation of Data Via Concurrently Determined Discriminant Functions -- The Undecidability of the Generalized Collatz Problem -- Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces -- Maximum Edge-Disjoint Paths Problem in Planar Graphs -- An Efficient Algorithm for Generating Colored Outerplanar Graphs -- Orthogonal Drawings for Plane Graphs with Specified Face Areas -- Absolutely Non-effective Predicates and Functions in Computable Analysis -- Linear-Size Log-Depth Negation-Limited Inverter for k-Tonic Binary Sequences -- The Existence of Unsatisfiable Formulas in k-LCNF for k???3 -- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model -- Phase Transition of Multivariate Polynomial Systems -- Approximation Algorithms for Maximum Edge Coloring Problem -- Two Improved Range-Efficient Algorithms for F 0 Estimation -- Approximation to the Minimum Rooted Star Cover Problem -- Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems -- Parameterized Algorithms for Weighted Matching and Packing Problems -- Kernelizations for Parameterized Counting Problems -- Revisiting the Impossibility for Boosting Service Resilience -- An Approximation Algorithm to the k-Steiner Forest Problem -- A Distributed Algorithm of Fault Recovery for Stateful Failover -- Path Embedding on Folded Hypercubes -- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. |
| Record Nr. | UNISA-996465766203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Models of Computation : 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Hong Zhu
| Theory and Applications of Models of Computation : 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings / / edited by Jin-Yi Cai, Barry S. Cooper, Hong Zhu |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (783 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Artificial intelligence Computer science—Mathematics Bioinformatics Theory of Computation Artificial Intelligence Mathematics of Computing |
| ISBN |
1-280-95658-5
9786610956586 3-540-72504-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Lectures -- Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm -- Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures -- Contributed Papers -- Approximation Algorithms for 3D Orthogonal Knapsack -- A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences -- The Hardness of Selective Network Design for Bottleneck Routing Games -- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns -- Elementary Differences Among Jump Hierarchies -- Working with the LR Degrees -- Computability on Subsets of Locally Compact Spaces -- A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs -- Finding a Duplicate and a Missing Item in a Stream -- Directed Searching Digraphs: Monotonicity and Complexity -- Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem -- Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing -- A Provably Secure Blind Signature Scheme -- Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2) -- New Left-to-Right Radix-r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems -- The Strongest Nonsplitting Theorem -- There is an Sw-Cuppable Strongly c.e. Real -- On Computation Complexity of the Concurrently Enabled Transition Set Problem -- Synchronization of Some DFA -- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs -- On Exact Complexity of Subgraph Homeomorphism -- Searching a Polygonal Region by Two Guards -- On the Internal Steiner Tree Problem -- Approximately Optimal Trees for Group Key Management with Batch Updates -- On Deciding Deep Holes of Reed-Solomon Codes -- Quantum Multiparty Communication Complexity and Circuit Lower Bounds -- Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions -- Improving the Average Delay of Sorting -- Approximating Capacitated Tree-Routings in Networks -- Feedback Arc Set Problem in Bipartite Tournaments -- Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc Network -- Enhancing Simulation for Checking Language Containment -- QBF-Based Symbolic Model Checking for Knowledge and Time -- A Characterization of the Language Classes Learnable with Correction Queries -- Learnable Algorithm on the Continuum -- Online Deadline Scheduling with Bounded Energy Efficiency -- Efficient Algorithms for Airline Problem -- Efficient Exact Arithmetic over Constructive Reals -- Bounding Run-Times of Local Adiabatic Algorithms -- A Note on Universal Composable Zero Knowledge in Common Reference String Model -- A Note on the Feasibility of Generalized Universal Composability -- t-Private and Secure Auctions -- Secure Multiparty Computations Using a Dial Lock -- A Time Hierarchy Theorem for Nondeterministic Cellular Automata -- Decidability of Propositional Projection Temporal Logic with Infinite Models -- Separation of Data Via Concurrently Determined Discriminant Functions -- The Undecidability of the Generalized Collatz Problem -- Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces -- Maximum Edge-Disjoint Paths Problem in Planar Graphs -- An Efficient Algorithm for Generating Colored Outerplanar Graphs -- Orthogonal Drawings for Plane Graphs with Specified Face Areas -- Absolutely Non-effective Predicates and Functions in Computable Analysis -- Linear-Size Log-Depth Negation-Limited Inverter for k-Tonic Binary Sequences -- The Existence of Unsatisfiable Formulas in k-LCNF for k???3 -- Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model -- Phase Transition of Multivariate Polynomial Systems -- Approximation Algorithms for Maximum Edge Coloring Problem -- Two Improved Range-Efficient Algorithms for F 0 Estimation -- Approximation to the Minimum Rooted Star Cover Problem -- Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems -- Parameterized Algorithms for Weighted Matching and Packing Problems -- Kernelizations for Parameterized Counting Problems -- Revisiting the Impossibility for Boosting Service Resilience -- An Approximation Algorithm to the k-Steiner Forest Problem -- A Distributed Algorithm of Fault Recovery for Stateful Failover -- Path Embedding on Folded Hypercubes -- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. |
| Record Nr. | UNINA-9910484985403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and applications of models of computation : third international conference, TAMC 2006, Beijing, China, May 15-20, 2006 : proceedings / / Jin-Yi Cai, S. Barry Cooper, Angsheng Li (eds.)
| Theory and applications of models of computation : third international conference, TAMC 2006, Beijing, China, May 15-20, 2006 : proceedings / / Jin-Yi Cai, S. Barry Cooper, Angsheng Li (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (XVI, 800 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
CaiJin-yi <1961->
CooperS. B (S. Barry) LiAngsheng |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computational complexity
Computable functions |
| ISBN | 3-540-34022-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Plenary Lectures -- On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance -- Similarity of Objects and the Meaning of Words -- Totally ? ? Computably Enumerable and m-topped Degrees -- Mitosis in Computational Complexity -- Models of Intuitionistic Set Theories over Partial Combinatory Algebras -- Width Versus Size in Resolution Proofs -- Recent Progress in Quantum Computational Complexity -- Algorithm -- On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times -- LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing -- A Bounded Item Bin Packing Problem over Discrete Distribution -- Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms -- Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges -- An ACO-Based Approach for Task Assignment and Scheduling of Multiprocessor Control Systems -- Adversary Immune Size Approximation of Single-Hop Radio Networks -- On Load-Balanced Semi-matchings for Weighted Bipartite Graphs -- Analyzing Chain Programs over Difference Constraints -- Linear-Time 2-Approximation Algorithm for the Watchman Route Problem -- Further Properties of Cayley Digraphs and Their Applications to Interconnection Networks -- Real Time Critical Edge of the Shortest Path in Transportation Networks -- Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations -- A New Approximation Algorithm for the k-Facility Location Problem -- Computational Complexity -- Alternative Measures of Computational Complexity with Applications to Agnostic Learning -- Disjoint NP-Pairs from Propositional Proof Systems -- Valiant’s Holant Theorem and Matchgate Tensors -- Variable Minimal Unsatisfiability -- A New Lower Bound of Critical Function for (k,s)-SAT -- Cluster Computing and the Power of Edge Recognition -- Quadratic Lower Bounds on Matrix Rigidity -- Non-reducible Descriptions for Conditional Kolmogorov Complexity -- Generalized Counters and Reversal Complexity -- Multisource Algorithmic Information Theory -- Block Sensitivity of Weakly Symmetric Functions -- Optimization Problems in the Polynomial-Time Hierarchy -- #3-Regular Bipartite Planar Vertex Cover is #P-Complete -- Group Theory Based Synthesis of Binary Reversible Circuits -- On Some Complexity Issues of NC Analytic Functions -- Learning Theory -- Learning Juntas in the Presence of Noise -- Grey Reinforcement Learning for Incomplete Information Processing -- On the Foundations of Universal Sequence Prediction -- Some Recent Results in U-Shaped Learning -- Learning Overcomplete Representations with a Generalized Gaussian Prior -- On PAC Learning Algorithms for Rich Boolean Function Classes -- On-Line Regression Competitive with Reproducing Kernel Hilbert Spaces -- Inductive Inference and Language Learning -- Time Series Predictions Using Multi-scale Support Vector Regressions -- Bioinformatics -- Identification and Comparison of Motifs in Brain-Specific and Muscle-Specific Alternative Splicing -- On Probe Permutation Graphs -- Automatic Classification of Protein Structures Based on Convex Hull Representation by Integrated Neural Network -- Protein Structure Comparison Based on a Measure of Information Discrepancy -- Succinct Text Indexes on Large Alphabet -- Security -- Identity-Based Threshold Proxy Signature Scheme with Known Signers -- Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions -- Formal Method -- Towards Practical Computable Functions on Context-Free Languages -- The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces -- Analysis of Properties of Petri Synthesis Net -- A Tree Construction of the Preferable Answer Sets for Prioritized Basic Disjunctive Logic Programs -- Object-Oriented Specification Composition and Refinement Via Category Theoretic Computations -- Improved SAT Based Bounded Model Checking -- Models of Computation -- Encodings and Arithmetic Operations in Membrane Computing -- The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation -- Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable -- The Trade-Off Theorem and Fragments of Gödel’s T -- On Non-binary Quantum BCH Codes -- Maximal Models of Assertion Graph in GSTE -- Computatability -- Immunity Properties and the n-C.E. Hierarchy -- On Rogers Semilattices -- Invertible Classes -- Universal Cupping Degrees -- On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal -- Enumeration Degrees of the Bounded Total Sets -- A Generic Set That Does Not Bound a Minimal Pair -- Lowness for Weakly 1-generic and Kurtz-Random -- On Differences Among Elementary Theories of Finite Levels of Ershov Hierarchies -- Computable Mathematics -- On Mass Problems of Presentability -- Beyond the First Main Theorem – When Is the Solution of a Linear Cauchy Problem Computable?. |
| Altri titoli varianti | TAMC 2006 |
| Record Nr. | UNINA-9910484970903321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||