Sciweavers

1352 search results - page 30 / 271
» An algorithm for minimizing the Mumford-Shah functional
Sort
View
EOR
2008
93views more  EOR 2008»
13 years 8 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
JPDC
2008
108views more  JPDC 2008»
13 years 8 months ago
Energy minimization with loop fusion and multi-functional-unit scheduling for multidimensional DSP
Energy saving is becoming one of the major design issues in processor architectures with multiple functional units (FUs). Nested loops are usually the most critical part in multim...
Meikang Qiu, Edwin Hsing-Mean Sha, Meilin Liu, Man...
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
14 years 24 days ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 9 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
SCALESPACE
2009
Springer
14 years 3 months ago
Geodesically Linked Active Contours: Evolution Strategy Based on Minimal Paths
The proposed method is related to parametric and geodesic active contours as well as minimal paths, in the context of image segmentation 1 . Our geodesically linked active contour ...
Julien Mille, Laurent D. Cohen