404 search results - page 11 / 81 » Robust Multiparty Computation with Linear Communication Comp... |
QCQC
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
IJBC
2008
13 years 7 months ago
2008
Abstract-- In this paper, we propose a robust hyperchaotic system that is practically serviceable in digital securecommunication. The system consists of many coupled robust logisti...
ICRA
1998
IEEE
13 years 11 months ago
1998
IEEE
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
TOC
2008
13 years 7 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....