Sciweavers

567 search results - page 3 / 114
» On the complexity of constrained VC-classes
Sort
View
COCO
2001
Springer
102views Algorithms» more  COCO 2001»
15 years 2 months ago
Links Between Complexity Theory and Constrained Block Coding
Larry J. Stockmeyer, Dharmendra S. Modha
DAM
2008
85views more  DAM 2008»
14 years 9 months ago
On the complexity of constrained VC-classes
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 th...
Joel Ratsaby
COMPGEOM
2003
ACM
15 years 2 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk