7200 search results - page 367 / 1440 » On the Computational Power of Winner-Take-All |
156
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
177
click to vote
ICPP
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—This paper analyzes energy characteristics of parallel algorithms executed on scalable multicore processors. Specifically, we provide a methodology for evaluating energ...
146
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Allometric scaling is an important universal property of metabolic living systems. It also describes the self-similar branching treeliked structures in transportation networks. Thi...
185
click to vote
PERCOM
2011
ACM
14 years 10 months ago
2011
ACM
— This paper focuses on the problem of rostering in intermittently connected passive RFID networks. It aims to report a list of tagged mobile nodes that appear in given intereste...
215
click to vote
CICC
2011
14 years 6 months ago
2011
Efforts to achieve the long-standing dream of realizing scalable learning algorithms for networks of spiking neurons in silicon have been hampered by (a) the limited scalability of...