847 search results - page 77 / 170 » Counting Polyominoes: A Parallel Implementation for Cluster ... |
151
click to vote
PACT
2009
Springer
15 years 10 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...
155
click to vote
LCR
1998
Springer
15 years 8 months ago
1998
Springer
There is an emerging class of real-time interactive applications that require the dynamic integration of task and data parallelism. An example is the Smart Kiosk, a free-standing ...
140
click to vote
ICPP
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...
123
click to vote
EUROPAR
2001
Springer
15 years 8 months ago
2001
Springer
As the technology for high-speed networks has evolved over the last decade, the interconnection of commodity computers (e.g., PCs and workstations) at gigabit rates has become a re...
157
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...