860 search results - page 62 / 172 » Lower Bounds on the Size of Test Data Sets |
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
ICDE
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, a method of handling both access frequency skew and data amount skew on a distributed parallel storage system under version management system is discussed. We assum...
CVPR
2011
IEEE
13 years 4 months ago
2011
IEEE
The goal of natural image denoising is to estimate a clean version of a given noisy image, utilizing prior knowledge on the statistics of natural images. The problem has been stud...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...