5331 search results - page 764 / 1067 » Algebraic Methods for Optimization Problems |
267
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we propose a method for matching articulated shapes represented as large sets of 3D points by aligning the corresponding embedded clouds generated by locally linear ...
182
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
155
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
In many applications it is desirable to learn from several kernels. "Multiple kernel learning" (MKL) allows the practitioner to optimize over linear combinations of kern...
187
Voted
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
205
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...