Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can b...
On the Internet, the limited query-processing capabilities of sources make answering even the simplest queries challenging. In this paper, we present a scheme called GenCompact fo...
Linear discriminant analysis (LDA) is a well-known scheme for feature extraction and dimensionality reduction of labeled data in a vector space. Recently, LDA has been extended to...
In this paper, we study the perturbation operator of Iterated Local Search. To guide more efficiently the search to move towards new promising regions of the search space, we intro...