Sciweavers

310 search results - page 20 / 62
» dam 2008
Sort
View
DAM
2008
85views more  DAM 2008»
15 years 13 days 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
DAM
2008
84views more  DAM 2008»
15 years 13 days ago
The colourful feasibility problem
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by B
Antoine Deza, Sui Huang, Tamon Stephen, Tamá...
SIAMCOMP
2000
59views more  SIAMCOMP 2000»
15 years 4 days ago
Quantum Entanglement and Communication Complexity
Harry Buhrman, Richard Cleve, Wim van Dam
FM
2008
Springer
91views Formal Methods» more  FM 2008»
15 years 1 months ago
Provably Correct Runtime Monitoring
Irem Aktug, Mads Dam, Dilian Gurov