1225 search results - page 83 / 245 » The Instance Complexity Conjecture |
SDM
2010
SIAM
13 years 10 months ago
2010
SIAM
Lack of labeled training examples is a common problem for many applications. In the same time, there is usually an abundance of labeled data from related tasks. But they have diff...
AICOM
2006
13 years 9 months ago
2006
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
JCT
2000
13 years 8 months ago
2000
Givena Hermitian,non-negativede nitekernelK and a character of the symmetric group on n letters, de ne the corresponding immanant function K x1;::: ;xn := P Qn i=1 Kxi;x i, where ...
CSMR
2010
IEEE
13 years 4 months ago
2010
IEEE
To avoid unnecessary maintenance costs in large IT systems resulting from poorly planned changes, it is essential to manage and control changes to the system and to verify that all...
ICALP
2011
Springer
13 years 15 days ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...