823 search results - page 18 / 165 » Stateful Subset Cover |
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
AAIM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
ECIR
2006
Springer
15 years 1 months ago
2006
Springer
We present first steps towards intelligent retrieval of music album covers from the web. The continuous growth of electronic music distribution constantly increases the interest in...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
124
click to vote
GC
2010
Springer
14 years 10 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...