Sciweavers

5263 search results - page 140 / 1053
» Open Constraint Optimization
Sort
View
92
Voted
SIAMJO
2008
57views more  SIAMJO 2008»
15 years 4 months ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel
ASAP
1997
IEEE
139views Hardware» more  ASAP 1997»
15 years 8 months ago
Buffer size optimization for full-search block matching algorithms
This paper presents how to find optimized buffer size for VLSI architectures of full-search block matching algorithms. Starting from the DG (dependency graph) analysis, we focus i...
Yuan-Hau Yeh, Chen-Yi Lee
SIAMCO
2008
121views more  SIAMCO 2008»
15 years 4 months ago
Numerical Verification of Optimality Conditions
A class of optimal control problem for a semilinear elliptic partial differential equation with control constraints is considered. It is well known that sufficient second-order con...
Arnd Rösch, Daniel Wachsmuth
120
Voted
TASLP
2010
78views more  TASLP 2010»
14 years 11 months ago
Solving Demodulation as an Optimization Problem
We introduce two new methods for the demodulation of acoustic signals by posing the problem in a convex optimization framework. This allows the parameters of the modulator and carr...
Gregory Sell, Malcolm Slaney
128
Voted
ICIP
2003
IEEE
16 years 6 months ago
Optimal strategies for spread-spectrum and quantized-projection image data hiding games with BER payoffs
We analyze spread-spectrum and quantization projection data hiding methods from a game-theoretic point of view, using the bit error rate (BER) as the payoff, and assuming that the...
Pedro Comesaña, Fernando Pérez-Gonz&...