Sciweavers

125 search results - page 13 / 25
» Semidefinite representation of convex sets
Sort
View
FMSD
2006
104views more  FMSD 2006»
13 years 7 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 8 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
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 2 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
ICIP
2005
IEEE
14 years 9 months ago
Semifragile hierarchical watermarking in a set theoretic framework
We introduce a set theoretic framework for watermarking and illustrate its effectiveness by designing a hierarchical semi-fragile watermark that is tolerant to compression and all...
Oktay Altun, Gaurav Sharma, Mehmet Utku Celik, Mar...
ICIP
2008
IEEE
14 years 2 months ago
Image representation by compressed sensing
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive...
Bing Han, Feng Wu, Dapeng Wu