We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Compressive sensing (CS) is an emerging approach for acquisition of signals having a sparse or compressible representation in some basis. While CS literature has mostly focused on...
In this paper, we study asymptotic uniform data-rate guarantees in large wireless networks from an information-theoretic viewpoint. We consider the following question: what is the...
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
This paper is concerned with the problem of robust filtering for uncertain linear discrete-time descriptor systems. The matrices of the system state-space model are uncertain, bel...