Sciweavers

403 search results - page 68 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
DCC
2002
IEEE
14 years 9 months ago
Zero-Error Source Coding with Maximum Distortion Criterion
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
Ertem Tuncel, Prashant Koulgi, Shankar L. Regunath...
IOPADS
1997
152views more  IOPADS 1997»
13 years 11 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
SIGECOM
2010
ACM
226views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Auctions with online supply
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
Moshe Babaioff, Liad Blumrosen, Aaron Roth
CDC
2009
IEEE
134views Control Systems» more  CDC 2009»
14 years 2 months ago
Event-based control using quadratic approximate value functions
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
Randy Cogill
EDBT
2006
ACM
105views Database» more  EDBT 2006»
14 years 10 months ago
HASE: A Hybrid Approach to Selectivity Estimation for Conjunctive Predicates
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
Xiaohui Yu, Nick Koudas, Calisto Zuzarte