489 search results - page 10 / 98 » Communication Complexity of Permutation-Invariant Functions |
DATE
2006
IEEE
15 years 4 months ago
2006
IEEE
Automakers are still facing an increasing complexity in vehicle requirements with regard to their EE systems. This complexity is not only caused by innovations, which are being pr...
102
click to vote
ISAAC
1995
Springer
15 years 1 months ago
1995
Springer
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract—Fingerprinting localization techniques provide reliable location estimates and enable the development of location aware applications especially for indoor environments, ...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...