58 search results - page 9 / 12 » On Rank vs. Communication Complexity |
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
74
Voted
IQ
2001
14 years 11 months ago
2001
: Physical and informational works are strongly interrelated in a business process. This facilitates modeling a business process as an integral part of a closed loop information an...
84
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
134
click to vote
TOG
2012
12 years 12 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
119
Voted
TCC
2007
Springer
15 years 3 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...