98 search results - page 4 / 20 » Lower bounds in communication complexity based on factorizat... |
INFOCOM
2005
IEEE
14 years 28 days ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...
NIPS
2008
13 years 8 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
COCO
2010
Springer
13 years 9 months 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...
ICDCN
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...