The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
Abstract. Random key pre-distribution schemes are vulnerable to collusion attacks. In this paper, we propose a new key management scheme for ubiquitous heterogeneous sensor network...
Firdous Kausar, Sajid Hussain, Jong Hyuk Park, Ash...
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...