11565 search results - page 174 / 2313 » Computing Minimal Mappings |
153
click to vote
ICCV
1999
IEEE
16 years 6 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
121
click to vote
VLSID
2007
IEEE
16 years 4 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
133
click to vote
VLSID
2003
IEEE
16 years 4 months ago
2003
IEEE
We consider the problem of minimizing the delay in transporting a signal across a distance in a VLSI circuit.The problem can be restated as a combined buffer insertion, buffer siz...
118
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
114
click to vote
DIS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper, first we introduce minimal and closed monotone DNF formulas as extensions of maximal and closed itemsets. Next, by incorporating the algorithm dnf cover d...