16 search results - page 1 / 4 » The complexity of class polynomial computation via floating ... |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
ICML
2004
IEEE
14 years 6 months ago
2004
IEEE
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
ENTCS
2007
13 years 5 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...