7 search results - page 1 / 2 » A Note on Randomized Streaming Space Bounds for the Longest ... |
ECCC
2010
13 years 4 months ago
2010
The deterministic space complexity of approximating the length of the longest increasing subsequence of a stream of N integers is known to be ( N). However, the randomized comple...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data streaming model. For t...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
APPROX
2011
Springer
12 years 4 months ago
2011
Springer
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...