167 search results - page 23 / 34 » A New Lower Bound for A(17, 6, 6) |
STOC
1999
ACM
14 years 8 days ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
DAGM
2003
Springer
14 years 1 months ago
2003
Springer
Recently Viola et al. have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce and empirically analysis ...
FOCS
1990
IEEE
14 years 1 days ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
DLOG
2004
13 years 9 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...