We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
— We define the concept of approximate domain optimizer for deterministic and expected value optimization criteria. Roughly speaking, a candidate optimizer is an approximate dom...
Andrea Lecchini-Visintini, John Lygeros, Jan M. Ma...
Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compres...
Ali Cafer Gurbuz, James H. McClellan, Volkan Cevhe...
In this paper we construct two new fuzzy identity-based encryption (IBE) schemes in the random oracle model. Not only do our schemes provide public parameters whose size is indepe...
The aim of blind source separation (BSS) is to transform a mixed random vector such that the original sources are recovered. If the sources are assumed to be statistically independ...