134 search results - page 22 / 27 » On the Complexity of Approximating the VC Dimension |
100
Voted
EDCC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present the PathCrawler prototype tool for the automatic generation of test-cases satisfying the rigorous all-paths criterion, with a user-defined limit on the number...
COMPGEOM
2000
ACM
15 years 1 months ago
2000
ACM
: We present a new approach for computing generalized Voronoi diagrams in two and three dimensions using interpolation-based polygon rasterization hardware. The input primitives ma...
CDES
2006
14 years 11 months ago
2006
: Over the last three decades there has been significant progress in the first principles methods for calculating the properties of materials at the quantum level. They have largel...
NIPS
1992
14 years 10 months ago
1992
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...