2816 search results - page 147 / 564 » Submodular function minimization |
CSREAESA
2003
15 years 2 months ago
2003
In this paper we address the problem of minimization of power consumption in combinational circuits by minimizing the number of switching transitions at the output nodes of each g...
109
click to vote
TCS
2008
15 years 19 days ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
117
Voted
COR
1999
15 years 12 days ago
1999
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
93
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this work we investigate the relationship between Bregman distances and regularized Logistic Regression model. We present a detailed study of Bregman Distance minimization, a f...
90
Voted
AAECC
2007
Springer
15 years 7 months ago
2007
Springer
We consider a generalization of the codes defined by norm and trace functions on finite fields introduced by Olav Geil. The codes in the new family still satisfy Geil’s dualit...