Sciweavers

1439 search results - page 82 / 288
» Fast approximation of centrality
Sort
View
SIAMSC
2008
117views more  SIAMSC 2008»
14 years 9 months ago
Adaptive, Fast, and Oblivious Convolution in Evolution Equations with Memory
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...
María López-Fernández, Christ...
IPPS
2010
IEEE
14 years 7 months ago
Optimizing and tuning the fast multipole method for state-of-the-art multicore architectures
This work presents the first extensive study of singlenode performance optimization, tuning, and analysis of the fast multipole method (FMM) on modern multicore systems. We consid...
Aparna Chandramowlishwaran, Samuel Williams, Leoni...
ICIP
2003
IEEE
15 years 11 months ago
Fast GEM wavelet-based image deconvolution algorithm
The paper proposes a new wavelet-based Bayesian approach to image deconvolution, under the space-invariant blur and additive white Gaussian noise assumptions. Image deconvolution ...
José M. Bioucas-Dias
ICIP
2001
IEEE
15 years 11 months ago
Improving a genetic algorithm segmentation by means of a fast edge detection technique
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
Angel Domingo Sappa, Vitoantonio Bevilacqua, Miche...
ICML
2005
IEEE
15 years 10 months ago
Fast maximum margin matrix factorization for collaborative prediction
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
Jason D. M. Rennie, Nathan Srebro