427 search results - page 33 / 86 » A Subexponential Bound for Linear Programming |
COLT
1999
Springer
13 years 12 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
CP
2003
Springer
14 years 28 days ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
ICALP
2010
Springer
14 years 14 days ago
2010
Springer
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...