We study the optimization of the expected number of bytes that must be transferred by the Web server when a user visits one of its pages. Given a Web site, we want to find an assi...
Evangelos Kranakis, Danny Krizanc, Miguel Vargas M...
Abstract. We examine efficacy of a classifier based on average of kernel density estimators; each estimator corresponds to a different data "resolution". Parameters of th...
We propose in this work a single copy and multi-hop opportunistic routing scheme for sparse delay tolerant networks (DTNs). The scheme uses as only input the estimates of the avera...
Abstract: Broadcast data dissemination is well-suited for mobile wireless environments, where bandwidth is scarce, and mutual interference must be minimized. However, broadcasting ...
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...