Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

DAM
2008

favoriteEmaildiscussreport

85views more DAM 2008»

On the complexity of constrained VC-classes

13 years 4 months ago

On the complexity of constrained VC-classes

Download www.ee.bgu.ac.il

Sauer's Lemma is extended to classes HN of binary-valued functions h on [n] = {1, . . . , n} which have a margin less than or equal to N on all x [n] with h(x) = 1, where the margin

Joel Ratsaby

Real-time Traffic

Binary-valued Functions | DAM 2008 | Largest Non-negative Integer | Non-negative |

claim paper

Related Content

» The Strange Complexity of Constrained Delaunay Triangulation

» Complexity Constrained NoiseFree CDMA Optimal Power Distribution and Spectral Efficiency

» Deconstructing intractability A multivariate complexity analysis of interval constrained ...

» A LowComplexity Algorithm for Uplink Scheduling in Cooperative Cellular Networks with a Ca...

» EBWIC A low Complexity and Efficient Rate Constrained Wavelet Image Coder

» Text Detection and Localization in Complex Scene Images using Constrained AdaBoost Algorit...

» Mechanism Design for ComplexityConstrained Bidders

» Constrained coalitional games formal framework properties and complexity results

» Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations

» Control Constrained Resource Partitioning for Complex SoCs

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Joel Ratsaby

Comments (0)