611 search results - page 112 / 123 » The Cardinality Matrix Constraint |
101
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
130
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also assoc...
80
Voted
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- We consider optimal experiment design for parametric prediction error system identification of linear timeinvariant systems in closed loop. The optimisation is performed...
106
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
SIAMNUM
2010
14 years 4 months ago
2010
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...