254 search results - page 8 / 51 » On randomized one-round communication complexity |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
TSP
2008
13 years 7 months ago
2008
The assessment of multivariate association between two complex random vectors is considered. A number of correlation coefficients based on three popular correlation analysis techni...
TSP
2010
13 years 2 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...