2746 search results - page 38 / 550 » Bisubmodular Function Minimization |
DCC
2004
IEEE
16 years 1 months ago
2004
IEEE
We address the problem of signal compression, basing on the mathematical model, in which a set of all possible signals is considered as a function space with a metric . The main a...
115
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
104
click to vote
DAM
1998
15 years 1 months ago
1998
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time sca...
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
106
click to vote
JGO
2008
15 years 1 months ago
2008
This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this ...