Results 1  10
of
358,116
Parameterized proof complexity: a complexity gap for parameterized treelike resolution
 Electronic Colloquium on Computational Complexity (ECCC
, 2007
"... We propose a prooftheoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given propositional formula cannot be satisfied by a truth assignment that sets at most k variables to true, considering k as the p ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
that treelike resolution does not admit such proofs. We obtain this result as a corollary to a metatheorem, the main result of this paper. The metatheorem extends Riis ’ Complexity Gap Theorem for treelike resolution. Riis ’ result establishes a dichotomy between polynomial and exponential size treelike
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
The Strength of Parameterized Treelike Resolution
"... We examine the prooftheoretic strength of parameterized treelike resolution—a proof system for the coW[2]complete set of parameterized tautologies. Parameterized resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider (FOCS’ ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
’07). In that paper, Dantchev et al. show a complexity gap in parameterized treelike resolution for propositional formulas arising from translations of firstorder principles. Here we pursue a purely combinatorial approach to obtain lower bounds to the proof size in parameterized treelike resolution
Parameterized Proof Complexity ∗
"... We propose a prooftheoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given propositional CNF formula cannot be satisfied by a truth assignment that sets at most k variables to true, considering k as th ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
function and n represents the size of the propositional formula. By way of a first step, we introduce the system of parameterized treelike resolution, and show that this system is not fptbounded. Indeed we give a general result on the size of shortest treelike resolution proofs of parameterized
Statistical mechanics of complex networks
 Rev. Mod. Phys
"... Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as ra ..."
Abstract

Cited by 2083 (10 self)
 Add to MetaCart
Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled
Hardness of Parameterized Resolution
"... Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dantchev et al. show a complexity gap in treelike Parameterized Resolution for propositional formulas arising from translatio ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dantchev et al. show a complexity gap in treelike Parameterized Resolution for propositional formulas arising from
A Volumetric Method for Building Complex Models from Range Images
, 1996
"... A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction, and robus ..."
Abstract

Cited by 1018 (18 self)
 Add to MetaCart
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: incremental updating, representation of directional uncertainty, the ability to fill gaps in the reconstruction
Statecharts: A Visual Formalism For Complex Systems
, 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract

Cited by 2683 (56 self)
 Add to MetaCart
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discreteevent systems, such as multicomputer realtime systems, communication protocols and digital control units. Our diagrams, which we
Linguistic Complexity: Locality of Syntactic Dependencies
 COGNITION
, 1998
"... This paper proposes a new theory of the relationship between the sentence processing mechanism and the available computational resources. This theory  the Syntactic Prediction Locality Theory (SPLT)  has two components: an integration cost component and a component for the memory cost associa ..."
Abstract

Cited by 486 (31 self)
 Add to MetaCart
This paper proposes a new theory of the relationship between the sentence processing mechanism and the available computational resources. This theory  the Syntactic Prediction Locality Theory (SPLT)  has two components: an integration cost component and a component for the memory cost
Coupled hidden Markov models for complex action recognition
, 1996
"... We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying twohanded actions. HMMs are perhaps the most successful framework in perceptual computing for modeling and ..."
Abstract

Cited by 497 (22 self)
 Add to MetaCart
We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying twohanded actions. HMMs are perhaps the most successful framework in perceptual computing for modeling
Results 1  10
of
358,116