19 search results - page 1 / 4 » Decomposition of multiple coverings into many parts |
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
ICML
2004
IEEE
14 years 5 months ago
2004
IEEE
Inductive learning of first-order theory based on examples has serious bottleneck in the enormous hypothesis search space needed, making existing learning approaches perform poorl...
AICCSA
2007
IEEE
13 years 11 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
AISC
2010
Springer
13 years 9 months ago
2010
Springer
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different bounda...