Sciweavers

113 search results - page 13 / 23
» Simpler is also better in approximating fixed points
Sort
View
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 5 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan
MOR
2010
115views more  MOR 2010»
13 years 2 months ago
Directional Derivatives of Oblique Reflection Maps
Given an oblique reflection map and functions , Dlim (the space of functions that have left and right limits at every point), the directional derivative () of along , evaluate...
Avi Mandelbaum, Kavita Ramanan
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
13 years 9 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper
JCP
2007
118views more  JCP 2007»
13 years 7 months ago
Dynamic Nonuniform Data Approximation in Databases with Haar Wavelet
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
Su Chen, Antonio Nucci
MST
2007
167views more  MST 2007»
13 years 7 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...