Sciweavers

3422 search results - page 187 / 685
» Random Subset Optimization
Sort
View
ALGORITHMICA
2008
78views more  ALGORITHMICA 2008»
15 years 6 months ago
Optimally Adaptive Integration of Univariate Lipschitz Functions
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
Ilya Baran, Erik D. Demaine, Dmitriy A. Katz
CORR
2008
Springer
151views Education» more  CORR 2008»
15 years 6 months ago
Exact Matrix Completion via Convex Optimization
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at ran...
Emmanuel J. Candès, Benjamin Recht
154
Voted
CORR
2008
Springer
77views Education» more  CORR 2008»
15 years 6 months ago
Optimal hash functions for approximate closest pairs on the n-cube
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
Daniel M. Gordon, Victor Miller, Peter Ostapenko
CORR
2011
Springer
183views Education» more  CORR 2011»
15 years 1 months ago
Mean-Variance Optimization in Markov Decision Processes
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
Shie Mannor, John N. Tsitsiklis
PE
2006
Springer
145views Optimization» more  PE 2006»
15 years 6 months ago
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...
Takayuki Osogami, Mor Harchol-Balter