134 search results - page 23 / 27 » On the Complexity of Approximating the VC Dimension |
TSP
2008
14 years 9 months ago
2008
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
100
Voted
COLT
2010
Springer
14 years 7 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
SIAMNUM
2011
14 years 4 months ago
2011
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
110
Voted
TSP
2011
14 years 4 months ago
2011
—Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switc...
JMLR
2010
14 years 4 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...