27 search results - page 4 / 6 » Simple integer recourse models: convexity and convex approxi... |
PIMRC
2008
IEEE
15 years 4 months ago
2008
IEEE
—We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on idea...
119
click to vote
ISPD
1997
ACM
15 years 1 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
JMLR
2002
14 years 9 months ago
2002
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
APPROX
2005
Springer
15 years 3 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...
109
click to vote
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D lin...