Sciweavers

201 search results - page 19 / 41
» Memory Optimizations For Fast Power-Aware Sparse Computation...
Sort
View
DAC
2003
ACM
14 years 8 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li
DAGSTUHL
2008
13 years 9 months ago
Fast (Parallel) Dense Linear System Solvers in C-XSC Using Error Free Transformations and BLAS
Existing selfverifying solvers for dense linear (interval-)systems in C-XSC provide high accuracy, but are rather slow. A new set of solvers is presented, which are a lot faster th...
Walter Krämer, Michael Zimmer
DAC
2009
ACM
14 years 7 days ago
Heterogeneous code cache: using scratchpad and main memory in dynamic binary translators
Dynamic binary translation (DBT) can be used to address important issues in embedded systems. DBT systems store translated code in a software-managed code cache. Unlike general-pu...
José Baiocchi, Bruce R. Childers
TCOM
2010
83views more  TCOM 2010»
13 years 2 months ago
Global and Fast Receiver Antenna Selection for MIMO Systems
Abstract--For a multiple-input multiple-output (MIMO) system with more antennas at the receiver than the transmitter, selecting the same number of receiver antennas as the number o...
Bu Hong Wang, Hon Tat Hui, Mook Seng Leong
NIPS
2008
13 years 9 months ago
Hebbian Learning of Bayes Optimal Decisions
Uncertainty is omnipresent when we perceive or interact with our environment, and the Bayesian framework provides computational methods for dealing with it. Mathematical models fo...
Bernhard Nessler, Michael Pfeiffer, Wolfgang Maass