1352 search results - page 11 / 271 » An algorithm for minimizing the Mumford-Shah functional |
CORR
2010
Springer
13 years 7 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...
INTEGRATION
2008
13 years 7 months ago
2008
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
CDES
2008
13 years 9 months ago
2008
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
TMC
2011
13 years 2 months ago
2011
— In large-scale fingerprinting localization systems, fine-grained location estimation and quick location determination are conflicting concerns. To achieve finer-grained loc...
CONSTRAINTS
2008
13 years 7 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...