Sciweavers

484 search results - page 18 / 97
» The number of convex permutominoes
Sort
View
ICML
2004
IEEE
14 years 11 months ago
Multiple kernel learning, conic duality, and the SMO algorithm
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. ...
Francis R. Bach, Gert R. G. Lanckriet, Michael I. ...
IWVF
2001
Springer
14 years 2 months ago
Straightening and Partitioning Shapes
A method for partitioning shapes is described based on a global convexity measure. Its advantages are that its global nature makes it robust to noise, and apart from the number of ...
Paul L. Rosin
CVPR
2010
IEEE
14 years 3 months ago
Face Recognition Based on Image Sets
We introduce a novel method for face recognition from image sets. In our setting each test and training example is a set of images of an individual’s face, not just a single ima...
Hakan Cevikalp, Bill Triggs
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 4 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
ISPD
1998
ACM
192views Hardware» more  ISPD 1998»
14 years 2 months ago
On convex formulation of the floorplan area minimization problem
It is shown that the oorplan area minimization problem can be formulated as a convex programming problem with the numbers of variables and constraints signi cantly less than those...
Temo Chen, Michael K. H. Fan