Sciweavers

2743 search results - page 1 / 549
» Minimization of an M-convex Function
Sort
View
DAM
1998
65views more  DAM 1998»
13 years 4 months ago
Minimization of an M-convex Function
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...
Akiyoshi Shioura
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
13 years 11 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
ECCV
2002
Springer
14 years 6 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
DAC
2003
ACM
14 years 5 months ago
Large-scale SOP minimization using decomposition and functional properties
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
Alan Mishchenko, Tsutomu Sasao
PPSN
2004
Springer
13 years 10 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...