Sciweavers

2477 search results - page 169 / 496
» Approximate extended formulations
Sort
View
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
16 years 4 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
GPCE
2004
Springer
15 years 10 months ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen
ICIP
1999
IEEE
15 years 8 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
ICCV
2009
IEEE
16 years 9 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
ICCV
2009
IEEE
16 years 9 months ago
Convex Optimization for Multi-Class Image Labeling with a Novel Family of Total Variation Based Regularizers
We introduce a linearly weighted variant of the total variation for vector fields in order to formulate regularizers for multi-class labeling problems with non-trivial interclass...
J. Lellmann, F. Becker, C. Schn¨orr