We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
Ali Dasdan, Paolo D'Alberto, Santanu Kolay, Chris ...
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
In this paper, we derive bounds on the Structural SIMilarity (SSIM) Index as a function of quantization rate for fixed-rate uniform quantization of image discrete cosine transform...
Sumohana S. Channappayya, Alan C. Bovik, Robert W....
Abstract--In this paper, we derive bounds on the structural similarity (SSIM) index as a function of quantization rate for fixed-rate uniform quantization of image discrete cosine ...
Sumohana S. Channappayya, Alan C. Bovik, Robert W....
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...