Sciweavers

7264 search results - page 1 / 1453
» A multiplicative up-propagation algorithm
Sort
View
NIPS
1997
13 years 6 months ago
Learning Generative Models with the Up-Propagation Algorithm
Up-propagation is an algorithm for inverting and learning neural network generative models. Sensory input is processed by inverting a model that generates patterns from hidden var...
Jong-Hoon Oh, H. Sebastian Seung
JMLR
2010
194views more  JMLR 2010»
12 years 11 months ago
A Statistical Implicative Analysis Based Algorithm and MMPC Algorithm for Detecting Multiple Dependencies
Discovering the dependencies among the variables of a domain from examples is an important problem in optimization. Many methods have been proposed for this purpose, but few large...
Elham Salehi, Jayashree Nyayachavadi, Robin Gras
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
12 years 8 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...
CPAIOR
2009
Springer
13 years 11 months ago
Reformulating Global Grammar Constraints
An attractive mechanism to specify global constraints in rostering and other domains is via formal languages. For instance, the REGULAR and GRAMMAR constraints specify constraints ...
George Katsirelos, Nina Narodytska, Toby Walsh
ISCAS
2011
IEEE
261views Hardware» more  ISCAS 2011»
12 years 8 months ago
Optimization of area in digit-serial Multiple Constant Multiplications at gate-level
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
Levent Aksoy, Cristiano Lazzari, Eduardo Costa, Pa...