Sciweavers

4155 search results - page 395 / 831
» External Memory Algorithms
Sort
View
TSP
2008
116views more  TSP 2008»
15 years 6 months ago
Fast Blind Separation of Long Mixture Recordings Using Multivariate Polynomial Identification
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...
Johan Thomas, Yannick Deville, Shahram Hosseini
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
ICCMS
2009
118views more  ICCMS 2009»
15 years 4 months ago
Optimized Parallel Implementation of Gillespie's First Reaction Method on Graphics Processing Units
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
Cristian Dittamo, Davide Cangelosi
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
15 years 1 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
TMI
2010
298views more  TMI 2010»
15 years 1 months ago
An Efficient Numerical Method for General Lp Regularization in Fluorescence Molecular Tomography
Abstract--Reconstruction algorithms for fluorescence tomography have to address two crucial issues : (i) the ill-posedness of the reconstruction problem, (ii) the large scale of nu...
Jean-Charles Baritaux, Kai Hassler, Michael Unser