Sciweavers

2816 search results - page 72 / 564
» Submodular function minimization
Sort
View
DATE
2009
IEEE
123views Hardware» more  DATE 2009»
15 years 4 months ago
On decomposing Boolean functions via extended cofactoring
—We investigate restructuring techniques based on decomposition/factorization, with the objective to move critical signals toward the output while minimizing area. A specific ap...
Anna Bernasconi, Valentina Ciriani, Gabriella Truc...
ASYNC
1998
IEEE
100views Hardware» more  ASYNC 1998»
15 years 2 months ago
An Implicit Method for Hazard-Free Two-Level Logic Minimization
None of the available minimizers for exact 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to heuristic...
Michael Theobald, Steven M. Nowick
128
Voted
CVPR
2009
IEEE
16 years 5 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 10 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
GMP
2010
IEEE
195views Solid Modeling» more  GMP 2010»
15 years 2 months ago
Construction of Minimal Catmull-Clark's Subdivision Surfaces with Given Boundaries
Minimal surface is an important class of surfaces. They are widely used in the areas such as architecture, art and natural science etc.. On the other hand, subdivision technology h...
Qing Pan, Guoliang Xu