Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
In this paper, we study the eigenvalue-based spectrum sensing techniques for multiple-antenna cognitive radio networks. First, we study the extreme eigenvalue distributions of a c...
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Abstract. Hinrichs [3] recently studied multivariate integration deļ¬ned over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...