489 search results - page 30 / 98 » Communication Complexity of Permutation-Invariant Functions |
FMOODS
2003
14 years 12 months ago
2003
Performance analysis of computing systems, in particular distributed computing systems, is a complex process. Analysing the complex flows and interactions between a set of distribu...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Locally and functionally distributed applications realized on different system architectures demand a universal, portable and intuitive software utility for interprocess communica...
ICCD
1997
IEEE
15 years 2 months ago
1997
IEEE
In this paper, we suggest a block-restricted sifting strategy which is based on the restriction of Rudell's sifting to certain blocks of variables. The application of this st...
IAT
2010
IEEE
14 years 8 months ago
2010
IEEE
As wireless sensor network applications grow in complexity, ad-hoc techniques are no longer adequate. Thus, it is crucial that these systems be adaptive and autonomous to remain f...
101
click to vote
COCO
2008
Springer
15 years 11 days ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...