Sciweavers

697 search results - page 81 / 140
» Convex Functions on Discrete Sets
Sort
View
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
16 years 21 days 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...
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
IJDAR
2010
164views more  IJDAR 2010»
14 years 9 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
RSS
2007
151views Robotics» more  RSS 2007»
15 years 1 months ago
An Implicit Time-Stepping Method for Multibody Systems with Intermittent Contact
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...
Nilanjan Chakraborty, Stephen Berard, Srinivas Ake...