806 search results - page 8 / 162 » Lower Bounds on Correction Networks |
COCO
2010
Springer
13 years 11 months ago
2010
Springer
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
IPPS
1997
IEEE
13 years 12 months ago
1997
IEEE
Gossiping is an information dissemination process in which each processor has a distinct item of information and has to collect all the items possessed by the other processors. In...
INFOCOM
2012
IEEE
12 years 6 months ago
2012
IEEE
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy
conditions and communication costs. This is motivated by a
numbe...