Sciweavers

6897 search results - page 649 / 1380
» Parallelization of Modular Algorithms
Sort
View
EGH
2009
Springer
15 years 4 months ago
Efficient stream compaction on wide SIMD many-core architectures
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...
Markus Billeter, Ola Olsson, Ulf Assarsson
SIGSOFT
2003
ACM
16 years 7 months ago
Towards scalable compositional analysis by refactoring design models
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
Yung-Pin Cheng, Michal Young, Che-Ling Huang, Chia...
KDD
2006
ACM
222views Data Mining» more  KDD 2006»
16 years 7 months ago
A component-based framework for knowledge discovery in bioinformatics
Motivation: In the field of bioinformatics there is an emerging need to integrate all knowledge discovery steps into a standardized modular framework. Indeed, component-based deve...
Julien Etienne, Bernd Wachmann, Lei Zhang
ICFP
2001
ACM
16 years 6 months ago
Recursive Structures for Standard ML
Standard ML is a statically typed programming language that is suited for the construction of both small and large programs. "Programming in the small" is captured by St...
Claudio V. Russo
EMSOFT
2007
Springer
16 years 1 months ago
Buffer optimization and dispatching scheme for embedded systems with behavioral transparency
Software components are modular and can enable post-deployment update, but their high overhead in runtime and memory is prohibitive for many embedded systems. This paper proposes ...
Jiwon Hahn, Pai H. Chou