171 search results - page 11 / 35 » Maximally fast and arbitrarily fast implementation of linear... |
ICCAD
2008
IEEE
14 years 4 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
ICCS
2009
Springer
14 years 2 months ago
2009
Springer
The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In this work, we utilize GPU’s high memory bandwidth for implementation of a sparse iterative...
ACSC
2009
IEEE
14 years 2 months ago
2009
IEEE
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
2010
Eurographics
Many useful algorithms for processing images and geometry fall under the general framework of high-dimensional Gaussian filtering. This family of algorithms includes bilateral ...