We consider several questions inspired by the direct-sum problem in (two-party) communication complexity. In all questions, there are k fixed Boolean functions f1, . . . , fk and ...
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevit...
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
Abstract In this paper, we propose a resource allocation algorithm for ergodic weighted-sum rate maximization in downlink OFDMA systems. In contrast to most previous research tha...
Abstract. Active Storage provides an opportunity for reducing the bandwidth requirements between the storage and compute elements of current supercomputing systems, and leveraging ...
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...