Sciweavers

3143 search results - page 105 / 629
» Minimization of entropy functionals
Sort
View
122
Voted
ICAI
2007
15 years 5 months ago
Dynamic Programming Algorithm for Training Functional Networks
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
Emad A. El-Sebakhy, Salahadin Mohammed, Moustafa E...
DATE
2009
IEEE
123views Hardware» more  DATE 2009»
15 years 10 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...
116
Voted
ASYNC
1998
IEEE
100views Hardware» more  ASYNC 1998»
15 years 7 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
173
Voted
CVPR
2009
IEEE
16 years 10 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...
113
Voted
CORR
2010
Springer
168views Education» more  CORR 2010»
15 years 3 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