1522 search results - page 73 / 305 » On the Complexity of Several Haplotyping Problems |
LATA
2010
Springer
14 years 28 days ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
MFCS
2001
Springer
14 years 7 days ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
EH
2000
IEEE
14 years 6 days ago
2000
IEEE
Evolvable Hardware (EHW) has the potential to become a new target hardware for complex real-world applications. However, there are several problems that would have to be solved to...
ICPR
2000
IEEE
14 years 6 days ago
2000
IEEE
In this paper, we propose a new self-calibration technique for cameras with changing zoom observing only a planar structure. The method does not need any metric or topologic knowl...
CCL
1994
Springer
13 years 12 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...