Sciweavers

17 search results - page 2 / 4
» An Effective Branch-and-Bound Algorithm for Convex Quadratic...
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
Simultaneous Point Matching and 3D Deformable Surface Reconstruction
It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape ...
Appu Shaji, Aydin Varol, Lorenzo Torresani, Pascal...
SIAMJO
2010
127views more  SIAMJO 2010»
12 years 11 months ago
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
We consider a recently proposed optimization formulation of multi-task learning based on trace norm regularized least squares. While this problem may be formulated as a semidefini...
Ting Kei Pong, Paul Tseng, Shuiwang Ji, Jieping Ye
TKDE
2012
245views Formal Methods» more  TKDE 2012»
11 years 7 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
COCOA
2008
Springer
13 years 6 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
JMLR
2006
145views more  JMLR 2006»
13 years 4 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street