4889 search results - page 192 / 978 » A Refactoring Approach to Parallelism |
IPPS
2009
IEEE
14 years 5 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
PACT
2009
Springer
14 years 5 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
CEC
2005
IEEE
14 years 4 months ago
2005
IEEE
Evolutionary Algorithms (EAs) are effective and robust methods for solving many practical problems such as feature selection, electrical circuits synthesis, and data mining. Howeve...
ICPPW
2005
IEEE
14 years 4 months ago
2005
IEEE
High-performance computing is essential for solving large problems and for reducing the time to solution for a single problem. Current top high-performance computing systems conta...