Results 1  10
of
12,595
Sublinear algorithms for approximating string compressibility
 In International Workshop on Randomization and Approximation Techniques in Computer Science
, 2007
"... We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: runlength encoding (RLE) and LempelZiv (LZ), and present sublinear algorithms for app ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: runlength encoding (RLE) and LempelZiv (LZ), and present sublinear algorithms
Sublinear Algorithms in the External Memory Model ∗
, 2010
"... We initiate the study of sublineartime algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged a unit cost for each block access. This model is wellstudied, since it reflects the computational issues occurring w ..."
Abstract
 Add to MetaCart
We initiate the study of sublineartime algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged a unit cost for each block access. This model is wellstudied, since it reflects the computational issues occurring
A sublinear algorithm for weakly approximating edit distance
 In Proc. STOC 2003
, 2003
"... We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two ncharacter strings A and B, runs in time o(n) and with high probability returns “CLOSE ” if their edit distance is O(n α), and “FAR”if their edit ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two ncharacter strings A and B, runs in time o(n) and with high probability returns “CLOSE ” if their edit distance is O(n α), and “FAR
Sublinear algorithms for testing monotone and unimodal distributions
 Proceedings of STOC 36th
, 2004
"... The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime algorithms—those for testing monotonicity and those that take advantage of monotonicity—are provided. The first algorithm te ..."
Abstract

Cited by 27 (8 self)
 Add to MetaCart
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime algorithms—those for testing monotonicity and those that take advantage of monotonicity—are provided. The first algorithm
Sublinear Algorithms for Penalized Logistic Regression in Massive Datasets
"... Abstract. Penalized logistic regression (PLR) is a widely used supervised learning model. In this paper, we consider its applications in largescale data problems and resort to a stochastic primaldual approach for solving PLR. In particular, we employ a random sampling technique in the primal step a ..."
Abstract
 Add to MetaCart
and a multiplicative weights method in the dual step. This technique leads to an optimization method with sublinear dependency on both the volume and dimensionality of training data. We develop concrete algorithms for PLR with ℓ2norm and ℓ1norm penalties, respectively. Experimental results over
Sublinear algorithms for outlier detection and generalized closeness testing
"... Abstract—Outlier detection is the problem of finding a few different distributions in a set of mostly identical ones. Closeness testing is the problem of deciding whether two distributions are identical or different. We relate the two problems, construct a sublinear generalized closeness test for u ..."
Abstract
 Add to MetaCart
Abstract—Outlier detection is the problem of finding a few different distributions in a set of mostly identical ones. Closeness testing is the problem of deciding whether two distributions are identical or different. We relate the two problems, construct a sublinear generalized closeness test
Sublinear Algorithms for Testing Monotone and Unimodal Distributions ABSTRACT
"... The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime algorithms—those for testing monotonicity and those that take advantage of monotonicity—are provided. The first algorithm te ..."
Abstract
 Add to MetaCart
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime algorithms—those for testing monotonicity and those that take advantage of monotonicity—are provided. The first algorithm
Sublinear algorithms for Earth mover's distance
, 2006
"... We study the problem of estimating the Earth Mover's Distance (EMD) between probability distributions when given access only to samples. We give closeness testers and additiveerror estimators over domains in [0, A], with sample complexities independent of domain size permitting the testabili ..."
Abstract
 Add to MetaCart
the testability even of continuous distributions over infinite domains. Instead, our algorithms depend on other parameters, such as the diameter of the domain space, which may be significantly smaller. We also prove lower bounds showing our testers to be optimal in their dependence on these parameters
Results 1  10
of
12,595