Sciweavers

800 search results - page 80 / 160
» Gaussian random number generators
Sort
View
ISPAN
2002
IEEE
14 years 1 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
TIT
2010
128views Education» more  TIT 2010»
13 years 2 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh
AUSAI
2005
Springer
14 years 1 months ago
Accelerating Real-Valued Genetic Algorithms Using Mutation-with-Momentum
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
Luke Temby, Peter Vamplew, Adam Berry
CSDA
2010
122views more  CSDA 2010»
13 years 8 months ago
Nonparametric density estimation for positive time series
The Gaussian kernel density estimator is known to have substantial problems for bounded random variables with high density at the boundaries. For i.i.d. data several solutions hav...
Taoufik Bouezmarni, Jeroen V. K. Rombouts
TMI
2010
133views more  TMI 2010»
13 years 6 months ago
Synthetic Magnetic Resonance Imaging Revisited
—Synthetic magnetic resonance (MR) imaging is an approach suggested in the literature to predict MR images at different design parameter settings from at least three observed MR ...
Ranjan Maitra, John J. Riddles