1941 search results - page 158 / 389 » On the Hardness of Approximate Reasoning |
179
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
131
click to vote
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
—With the prospect of atomic-scale computing, we study cumulative energy profiles of spin-spin interactions in nonferromagnetic lattices (Ising spin-glasses)—an established to...
227
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
152
click to vote
AAAI
2008
15 years 8 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
192
click to vote
ACL
2007
15 years 8 months ago
2007
Convolution tree kernel has shown promising results in semantic role classification. However, it only carries out hard matching, which may lead to over-fitting and less accurate s...