134 search results - page 20 / 27 » On the Complexity of Approximating the VC Dimension |
CORR
2010
Springer
14 years 4 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
SIAMNUM
2011
14 years 4 months ago
2011
We present a method to approximate (in any space dimension) diffusion equations with schemes having a specific structure; this structure ensures that the discrete local maximum a...
RTSS
1999
IEEE
15 years 1 months ago
1999
IEEE
The problem of maximizing system utility by allocating a single finite resource to satisfy discrete Quality of Service (QoS) requirements of multiple applications along multiple Q...
COLT
2010
Springer
14 years 7 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
— During a complete running stride, which involves significant periods of flight during which no legs are contacting the ground, a quadruped cannot employ static stability tech...