Sciweavers

3247 search results - page 28 / 650
» Randomized smoothing networks
Sort
View
ICIP
2007
IEEE
15 years 6 months ago
Lossy Compression of Bilevel Images Based on Markov Random Fields
A new method for lossy compression of bilevel images based on Markov random fields (MRFs) is proposed. It preserves key structural information about the image, and then reconstru...
Matthew G. Reyes, Xiaonan Zhao, David L. Neuhoff, ...
STACS
2005
Springer
15 years 5 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
JC
2006
68views more  JC 2006»
14 years 11 months ago
Monte Carlo approximation of weakly singular integral operators
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
Stefan Heinrich
DMTCS
2010
126views Mathematics» more  DMTCS 2010»
14 years 9 months ago
Asymptotic variance of random symmetric digital search trees
Hsien-Kuei Hwang, Michael Fuchs, Vytas Zacharovas