Sciweavers

164 search results - page 18 / 33
» Developing Genetic Algorithms for Boolean Matrix Factorizati...
Sort
View
IPPS
2005
IEEE
15 years 5 months ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
Soumya Sanyal, Sajal K. Das
PPOPP
1991
ACM
15 years 3 months ago
Coarse-Grain Parallel Programming in Jade
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...
Monica S. Lam, Martin C. Rinard
ICASSP
2010
IEEE
14 years 9 months ago
A sparse component model of source signals and its application to blind source separation
In this paper, we propose a new method of blind source separation (BSS) for music signals. Our method has the following characteristics: 1) the method is a combination of the spar...
Yu Kitano, Hirokazu Kameoka, Yosuke Izumi, Nobutak...
BMCBI
2010
62views more  BMCBI 2010»
14 years 11 months ago
Forward-time simulation of realistic samples for genome-wide association studies
Background: Forward-time simulations have unique advantages in power and flexibility for the simulation of genetic samples of complex human diseases because they can closely mimic...
Bo Peng, Christopher I. Amos
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
15 years 5 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...