Sciweavers

55 search results - page 8 / 11
» Could there be exactly two things
Sort
View
ECCC
2007
90views more  ECCC 2007»
13 years 7 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
MST
2006
149views more  MST 2006»
13 years 7 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
EXACT
2009
13 years 5 months ago
Explanations and Arguments Based on Practical Reasoning
In this paper a representative example is chosen that is meant be fairly simple for illustrating the point that in a very common kind of instance, argument and explanation are mixe...
Douglas Walton
ICALP
2009
Springer
14 years 7 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
MUC
1992
13 years 11 months ago
GE-CMU: description of the TIPSTER/SHOGUN system as used for MUC-4
The GE-CMU team is developing the TIPSTER/SHOGUN system under the governmentsponsored TIPSTER program, which aims to advance coverage, accuracy, and portability in tex t interpret...
Paul S. Jacobs, George B. Krupka, Lisa F. Rau, Tod...