Sciweavers

2333 search results - page 277 / 467
» Recursive Computational Depth
Sort
View
ENTCS
2007
102views more  ENTCS 2007»
15 years 2 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka
NC
2008
126views Neural Networks» more  NC 2008»
15 years 2 months ago
Spiking neural P systems with extended rules: universality and languages
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj,...
120
Voted
IJPP
2007
91views more  IJPP 2007»
15 years 2 months ago
A Compositional Framework for Developing Parallel Programs on Two-Dimensional Arrays
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Zhenjiang Hu, Kazuhiko Kakehi, Masato...
CACM
2005
59views more  CACM 2005»
15 years 2 months ago
Is the thrill gone?
een program and data, abstraction, recursion, tractability, virtualization, and fault tolerance are among its basic principles. No one would dispute that the very idea of computing...
Sanjeev Arora, Bernard Chazelle
ICONIP
2010
15 years 26 days ago
Improving Recurrent Neural Network Performance Using Transfer Entropy
Abstract. Reservoir computing approaches have been successfully applied to a variety of tasks. An inherent problem of these approaches, is, however, their variation in performance ...
Oliver Obst, Joschka Boedecker, Minoru Asada