489 search results - page 22 / 98 » Communication Complexity of Permutation-Invariant Functions |
113
click to vote
COCO
2005
Springer
15 years 4 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
INFOCOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— High-order full-state Markov (FSM) chains have been employed to model errors and losses in many wireless studies. The complexity of this modeling paradigm is an exponential fun...
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
112
click to vote
GLOBECOM
2008
IEEE
14 years 10 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
107
click to vote
AAAIDEA
2005
IEEE
15 years 4 months ago
2005
IEEE
—Differentiated Service (DiffServ) in combination with Multi-Protocol Label Switching (MPLS) is a promising technology in converting the best-effort Internet into a QoS-capable n...