7200 search results - page 48 / 1440 » On the Computational Power of Winner-Take-All |
ISCAS
2011
IEEE
13 years 13 days ago
2011
IEEE
— In this study, synchronization phenomena observed in coupled polygonal oscillatory networks with frustration is investigated. We focus on the power consumption of coupling resi...
ENTCS
2008
13 years 8 months ago
2008
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
JSC
2006
13 years 8 months ago
2006
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
APAL
2010
13 years 8 months ago
2010
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
DAC
1997
ACM
14 years 28 days ago
1997
ACM
-- Designing for low power has become increasingly important in a wide variety of applications, including wireless telephony, mobile computing, high performance computing, and high...