1225 search results - page 102 / 245 » The Instance Complexity Conjecture |
JMLR
2012
11 years 11 months ago
2012
A challenging problem of multi-label learning is that both the label space and the model complexity will grow rapidly with the increase in the number of labels, and thus makes the...
CADE
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
ECCC
2007
13 years 9 months ago
2007
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
The interaction and integration of agent technology and data mining presents prominent benefits to solve some of challenging issues in individual areas. For instance, data mining ...