Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search, we conduct an experimental analysis of destination sampling, a dynamic algorithm...
Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Dev...
Abstract We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Construct...
In a multiple-access communication network, nodes must compete for scarce communication resources such as bandwidth. This paper analyzes the asymptotic behavior of a multipleaccess...
Hazer Inaltekin, Mung Chiang, Harold Vincent Poor,...
In this paper the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the syst...
Yijia Fan, Lifeng Lai, Elza Erkip, H. Vincent Poor