Sciweavers

915 search results - page 112 / 183
» Maximally Abstract Retrenchments
Sort
View
ICIAP
2005
ACM
14 years 8 months ago
Greedy Algorithm for Local Contrast Enhancement of Images
Abstract. We present a technique that achieves local contrast enhancement by representing it as an optimization problem. For this, we first introduce a scalar objective function th...
Kartic Subr, Aditi Majumder, Sandy Irani
ALT
2002
Springer
14 years 5 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
ALT
2000
Springer
14 years 5 months ago
On Approximate Learning by Multi-layered Feedforward Circuits
Abstract. We consider the problem of efficient approximate learning by multilayered feedforward circuits subject to two objective functions. First, we consider the objective to ma...
Bhaskar DasGupta, Barbara Hammer
ICCAD
2008
IEEE
98views Hardware» more  ICCAD 2008»
14 years 5 months ago
Statistical path selection for at-speed test
Abstract— Process variations make at-speed testing significantly more difficult. They cause subtle delay changes that are distributed rather than the localized nature of a trad...
Vladimir Zolotov, Jinjun Xiong, Hanif Fatemi, Chan...
EVOW
2010
Springer
14 years 2 months ago
Gaussian Adaptation Revisited - An Entropic View on Covariance Matrix Adaptation
Abstract. We revisit Gaussian Adaptation (GaA), a black-box optimizer for discrete and continuous problems that has been developed in the late 1960’s. This largely neglected sear...
Christian L. Müller, Ivo F. Sbalzarini