33 search results - page 3 / 7 » The Minimum Consistent DFA Problem Cannot Be Approximated wi... |
APPROX
2007
Springer
14 years 14 days ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
COMPSAC
2004
IEEE
13 years 10 months ago
2004
IEEE
Emerging patterns have been studied as a useful type of pattern for the diagnosis and understanding of diseases based on the analysis of gene expression profiles. They are useful ...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
CPM
2000
Springer
13 years 10 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
COCOON
2009
Springer
14 years 26 days ago
2009
Springer
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...