Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
The energy-delay tradeoffs in wireless networks are studied using a game-theoretic framework. A multi-class multipleaccess network is considered in which users choose their transmi...
Farhad Meshkati, H. Vincent Poor, Stuart C. Schwar...
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...
ODRL is a popular XML-based language for stating the conditions under which resources can be accessed. The language is underspecified, and can be reasonably interpreted in a number...
In the UNIX/Linux environment the kernel can log every command process created by every user using process accounting. This data has many potential uses, including the investigati...
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
The problem of joint universal source coding and modeling, addressed by Rissanen in the context of lossless codes, is generalized to fixed-rate lossy coding of continuousalphabet m...
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...