2924 search results - page 166 / 585 » Lower Bounds in Distributed Computing |
TIT
1998
15 years 14 days ago
1998
— The lower and upper bounds for the information capacity of two-layer feedforward neural networks with binary interconnections, integer thresholds for the hidden units, and zero...
107
click to vote
JGT
2010
14 years 11 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
80
Voted
SRDS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and m...
115
Voted
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
112
Voted
PODS
2008
ACM
16 years 29 days ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...