489 search results - page 21 / 98 » Communication Complexity of Permutation-Invariant Functions |
COCO
2010
Springer
15 years 14 days ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
SEAAI
1998
Springer
15 years 2 months ago
1998
Springer
In a multidisciplinary design environment, such as the architecture, engineering and construction (AEC) domain, the various designers will have their own views, concepts and repre...
GLOBECOM
2009
IEEE
15 years 2 months ago
2009
IEEE
A new method is proposed for the blind subspace-based identification of the coefficients of time-varying (TV) single-input multiple-output (SIMO) FIR channels. The TV channel coef...
NOMS
2010
IEEE
14 years 9 months ago
2010
IEEE
—Application level traffic classification is one of the major issues in network monitoring and traffic engineering. In our previous study, we proposed a new traffic classificatio...
56
Voted
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...