The central topic of this work is the categories of modules over unital quantales. The main categorical properties are established and a special class of operators, called Q-module...
We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common messa...
We introduce a new online convex optimization algorithm that adaptively chooses its regularization function based on the loss functions observed so far. This is in contrast to pre...
Huffman coding is often presented as the optimal solution to Twenty Questions. However, a caveat is that Twenty Questions games always end with a reply of "Yes," whereas ...
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is mo...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
The promise of search-driven development is that developers will save time and resources by reusing external code in their local projects. To efficiently integrate this code, user...
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
Changbo Chen, James H. Davenport, John P. May, Mar...
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
Olav Geil, Carlos Munuera, Diego Ruano, Fernando T...
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...