Sciweavers

1600 search results - page 280 / 320
» Clustering for opportunistic communication
Sort
View
PACT
2009
Springer
14 years 5 months ago
Parallel FFT with Eden Skeletons
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...
Jost Berthold, Mischa Dieterle, Oleg Lobachev, Rit...
CCGRID
2008
IEEE
14 years 5 months ago
A Proactive Non-Cooperative Game-Theoretic Framework for Data Replication in Data Grids
— Data grids and its cost effective nature has taken on a new level of interest in recent years; amalgamation of different providers results in increased capacity as well as lowe...
Ali Elghirani, Riky Subrata, Albert Y. Zomaya
CCGRID
2008
IEEE
14 years 5 months ago
Enabling Interoperability among Meta-Schedulers
Grid computing supports shared access to computing resources from cooperating organizations or institutes in the form of virtual organizations. Resource brokering middleware, comm...
Norman Bobroff, Liana Fong, Selim Kalayci, Yanbin ...
ICPADS
2008
IEEE
14 years 5 months ago
Parallel Large Scale Inference of Protein Domain Families
The resolution of combinatorial assortments of protein sequences into domains is a prerequisite for protein sequence interpretation. However the recognition and clustering of homo...
Daniel Kahn, Clément Rezvoy, Fréd&ea...
ICPP
2008
IEEE
14 years 5 months ago
Parallel Inferencing for OWL Knowledge Bases
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...
Ramakrishna Soma, Viktor K. Prasanna