13 search results - page 2 / 3 » Bounded Independence Fools Degree-2 Threshold Functions |
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
SIAMIS
2011
13 years 7 days ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
WCNC
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract—In this paper, we propose an output-threshold multiple relay selection scheme for dual-hop multi-branch cooperative wireless networks. The proposed scheme selects the ...
DIALM
2008
ACM
13 years 7 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
EUROCOLT
1997
Springer
13 years 9 months ago
1997
Springer
Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning app...