Sciweavers

2743 search results - page 104 / 549
» Minimization of an M-convex Function
Sort
View
MST
2006
120views more  MST 2006»
15 years 5 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...
ICAI
2007
15 years 7 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...
ICPR
2008
IEEE
16 years 6 months ago
Bregman distance to L1 regularized logistic regression
In this work we investigate the relationship between Bregman distances and regularized Logistic Regression model. We present a detailed study of Bregman Distance minimization, a f...
Mithun Das Gupta, Thomas S. Huang
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
15 years 12 months ago
Extended Norm-Trace Codes with Optimized Correction Capability
We consider a generalization of the codes defined by norm and trace functions on finite fields introduced by Olav Geil. The codes in the new family still satisfy Geil’s dualit...
Maria Bras-Amorós, Michael E. O'Sullivan
166
Voted
DATE
2005
IEEE
117views Hardware» more  DATE 2005»
15 years 11 months ago
Low Cost Task Migration Initiation in a Heterogeneous MP-SoC
Run-time task migration in a heterogeneous multiprocessor System-on-Chip (MP-SoC) is a challenge that requires cooperation between the task and the operating system. In task migra...
Vincent Nollet, Prabhat Avasare, Jean-Yves Mignole...