1092 search results - page 90 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
154
click to vote
STOC
2005
ACM
16 years 6 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...
144
click to vote
IPL
2008
15 years 6 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
177
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
150
click to vote
ICML
2004
IEEE
16 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...
178
click to vote
IWPEC
2004
Springer
15 years 11 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...