Sciweavers

1675 search results - page 24 / 335
» Implementing Data Cubes Efficiently
Sort
View
VLSISP
2008
118views more  VLSISP 2008»
13 years 9 months ago
Analysis of Lifting and B-Spline DWT Implementations for Implantable Neuroprosthetics
Abstract. The large amount of data generated by neuroprosthetic devices requires a high communication bandwidth for extra-cranial transmission, critically limiting the number and u...
Awais M. Kamboh, Andrew Mason, Karim G. Oweiss
HIPEAC
2009
Springer
14 years 1 months ago
Deriving Efficient Data Movement from Decoupled Access/Execute Specifications
Abstract. On multi-core architectures with software-managed memories, effectively orchestrating data movement is essential to performance, but is tedious and error-prone. In this p...
Lee W. Howes, Anton Lokhmotov, Alastair F. Donalds...
FCCM
2006
IEEE
170views VLSI» more  FCCM 2006»
14 years 1 months ago
An Architecture for Efficient Hardware Data Mining using Reconfigurable Computing Systems
The Apriori algorithm is a fundamental correlation-based data mining kernel used in a variety of fields. The innovation in this paper is a highly parallel custom architecture impl...
Zachary K. Baker, Viktor K. Prasanna
CONCURRENCY
2004
151views more  CONCURRENCY 2004»
13 years 9 months ago
User transparency: a fully sequential programming model for efficient data parallel image processing
Although many image processing applications are ideally suited for parallel implementation, most researchers in imaging do not benefit from high performance computing on a daily b...
Frank J. Seinstra, Dennis Koelma
PLILP
1990
Springer
14 years 1 months ago
Efficient Data Representation in Polymorphic Languages
Languages with polymorphic types (e.g. ML) have traditionally been implemented using Lisp-like data representations--everything has to fit in one word, if necessary by being heap-...
Xavier Leroy