Sciweavers

806 search results - page 1 / 162
» Lower Bounds on Correction Networks
Sort
View
ISAAC
2003
Springer
129views Algorithms» more  ISAAC 2003»
13 years 10 months ago
Lower Bounds on Correction Networks
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such netw...
Grzegorz Stachowiak
COLT
1993
Springer
13 years 9 months ago
Lower Bounds on the Vapnik-Chervonenkis Dimension of Multi-Layer Threshold Networks
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...
Peter L. Bartlett
PODC
1993
ACM
13 years 9 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
COLT
1994
Springer
13 years 9 months ago
Lower Bounds on the VC-Dimension of Smoothly Parametrized Function Classes
We examine the relationship between the VCdimension and the number of parameters of a smoothly parametrized function class. We show that the VC-dimension of such a function class ...
Wee Sun Lee, Peter L. Bartlett, Robert C. Williams...
ECCC
2010
80views more  ECCC 2010»
13 years 5 months ago
Pseudorandom Generators, Typically-Correct Derandomization, and Circuit Lower Bounds
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel