Sciweavers

115 search results - page 11 / 23
» An Efficient Interior-Point Method for Convex Multicriteria ...
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Learning kernels from indefinite similarities
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
Yihua Chen, Maya R. Gupta, Benjamin Recht
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 8 months ago
Estimating divergence functionals and the likelihood ratio by convex risk minimization
We develop and analyze M-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variatio...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
CVPR
2007
IEEE
14 years 10 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler
ICML
2006
IEEE
14 years 9 months ago
Optimal kernel selection in Kernel Fisher discriminant analysis
In Kernel Fisher discriminant analysis (KFDA), we carry out Fisher linear discriminant analysis in a high dimensional feature space defined implicitly by a kernel. The performance...
Seung-Jean Kim, Alessandro Magnani, Stephen P. Boy...
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
13 years 10 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...