Sciweavers

5169 search results - page 15 / 1034
» Locality approximation using time
Sort
View
ICIP
2006
IEEE
14 years 8 months ago
Fast Non-Local Algorithm for Image Denoising
For the non-local denoising approach presented by Buades et al., remarkable denoising results are obtained at high expense of computational cost. In this paper, a new algorithm th...
Jin Wang, Yanwen Guo, Yiting Ying, Yanli Liu, Quns...
CAGD
2006
90views more  CAGD 2006»
13 years 6 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
AAIM
2008
Springer
131views Algorithms» more  AAIM 2008»
14 years 1 months ago
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...
Zhi-Zhong Chen, Ruka Tanahashi
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
13 years 10 months ago
Filter approximation using explicit time and frequency domain specifications
We demonstrate that enhanced particle swarm optimization (PSO) can be successfully used to evolve high performance filter approximations. These evolved approximations use sets of ...
Varun Aggarwal, Wesley O. Jin, Una-May O'Reilly
SCL
2008
109views more  SCL 2008»
13 years 6 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar