77 search results - page 16 / 16 » Sample Size Lower Bounds in PAC Learning by Algorithmic Comp... |
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
EMSOFT
2009
Springer
13 years 9 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...