3898 search results - page 195 / 780 » On the Bit Extraction Problem |
126
click to vote
PODC
2009
ACM
15 years 9 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
152
click to vote
COLT
2008
Springer
15 years 4 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
121
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract--In this two-part paper, we study the design and optimization of limited feedback single-user and multiuser systems with a multiple-antenna base station and single-antenna...
111
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
132
click to vote
EAAI
2007
15 years 3 months ago
2007
The task-oriented nature of data mining (DM) has already been dealt successfully with the employment of intelligent agent systems that distribute tasks, collaborate and synchroniz...