Sciweavers

6365 search results - page 328 / 1273
» Fast Local Computation Algorithms
Sort
View
TOG
2002
129views more  TOG 2002»
15 years 6 months ago
Fast bilateral filtering for the display of high-dynamic-range images
We present a new technique for the display of high-dynamic-range images, which reduces the contrast while preserving detail. It is based on a two-scale decomposition of the image ...
Frédo Durand, Julie Dorsey
191
Voted
ICMCS
2009
IEEE
130views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Fast multi-reference motion estimation via statistical learning for H.264/AVC
In the H.264/AVC coding standard, motion estimation (ME) is allowed to use multiple reference frames to make full use of reducing temporal redundancy in a video sequence. Although...
Chen-Kuo Chiang, Shang-Hong Lai
ICASSP
2011
IEEE
14 years 10 months ago
A fast transform for acoustic imaging with separable arrays
Acoustic imaging is a computationally intensive and ill-conditioned inverse problem, which involves estimating high resolution source distributions with large microphone arrays. I...
Flavio P. Ribeiro, Vitor H. Nascimento
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
16 years 27 days ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
PODC
2012
ACM
13 years 9 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya