611 search results - page 52 / 123 » The Cardinality Matrix Constraint |
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper considers the problem of lter design with secrecy constraints, where two legitimate parties (Alice and Bob) communicate in the presence of an eavesdropper (Eve), over a...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
IPCV
2007
14 years 11 months ago
2007
- The shrunk dimension of electronic devices leads to more stringent requirement on process control and quality assurance of their fabrication. For instance, direct die-to-die bond...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents a blind dereverberation method designed to recover the subband envelope of an original speech signal from its reverberant version. The problem is formulated as...