Sciweavers

350 search results - page 46 / 70
» On the symmetry function of a convex set
Sort
View
MP
1998
108views more  MP 1998»
14 years 10 months ago
Base polytopes of series-parallel posets: Linear description and optimization
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
Rainer Schrader, Andreas S. Schulz, Georg Wambach
CVPR
2008
IEEE
16 years 1 months ago
Globally optimal bilinear programming for computer vision applications
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...
Manmohan Krishna Chandraker, David J. Kriegman
ICML
2006
IEEE
15 years 12 months ago
Deterministic annealing for semi-supervised kernel machines
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chape...
86
Voted
SIAMSC
2008
139views more  SIAMSC 2008»
14 years 11 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
122
Voted
IJDAR
2010
164views more  IJDAR 2010»
14 years 8 months ago
Distance-based classification of handwritten symbols
We study online classification of isolated handwritten symbols using distance measures on spaces of curves. We compare three distance-based measures on a vector space representatio...
Oleg Golubitsky, Stephen M. Watt