56 search results - page 9 / 12 » Minimizing Convex Functions with Bounded Perturbations |
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
81
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— Adaptive rate/power control schemes have great potential to increase the throughput of wireless CDMA networks. In this paper, we investigate the additional gains achiev...
82
Voted
SPAA
1996
ACM
15 years 1 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...