27 search results - page 1 / 6 » Local Search in Smooth Convex Sets |
114
Voted
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
197
click to vote
JMLR
2010
15 years 4 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
123
click to vote
NIPS
2003
15 years 7 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
190
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
181
click to vote
PKDD
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. In content-based image retrieval (CBIR) and image screening, it is often desirable to locate the regions of interest (ROI) in the images automatically. This can be accomp...