796 search results - page 90 / 160 » Approximating the centroid is hard |
AAAI
2008
13 years 10 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...
ACL
2007
13 years 9 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...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...