Sciweavers

2479 search results - page 92 / 496
» A Computational Theory of Working Memory
Sort
View
TSP
2010
13 years 2 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
ERSA
2007
194views Hardware» more  ERSA 2007»
13 years 9 months ago
A Scalable and Reconfigurable Shared-Memory Graphics Cluster Architecture
Abstract: If the computational demands of an interactive graphics rendering application cannot be met by a single commodity Graphics Processing Unit (GPU), multiple graphics accele...
Ross Brennan, Michael Manzke, Keith O'Conor, John ...
GLVLSI
2003
IEEE
134views VLSI» more  GLVLSI 2003»
14 years 1 months ago
Information storage capacity of crossbar switching networks
In this work we ask the fundamental question: How many bits of information can be stored in a crossbar switching network? The answer is trivial when the switches of the network ar...
Paul-Peter Sotiriadis
HPCA
2002
IEEE
14 years 8 months ago
The Minimax Cache: An Energy-Efficient Framework for Media Processors
This work is based on our philosophy of providing interlayer system-level power awareness in computing systems [26, 27]. Here, we couple this approach with our vision of multipart...
Osman S. Unsal, Israel Koren, C. Mani Krishna, Csa...
EUROPAR
1999
Springer
14 years 20 hour ago
DAOS - Scalable And-Or Parallelism
Abstract. This paper presents DAOS, a model for exploitation of Andand Or-parallelism in logic programs. DAOS assumes a physically distributed memory environment and a logically sh...
Luís Fernando Castro, Vítor Santos C...