Better Bounds for Frequency Moments in Random-Order Streams

Details Better Bounds for Frequency Moments in Random-Order Streams Better Bounds for Frequency Moments in Random-Order Streams

2008-08-16

arxiv.org/abs/0808.2222v1

Computer Science

Data Structures and Algorithms

4 pages

Scientific paper

Estimating frequency moments of data streams is a very well studied problem and tight bounds are known on the amount of space that is necessary and sufficient when the stream is adversarially ordered. Recently, motivated by various practical considerations and applications in learning and statistics, there has been growing interest into studying streams that are randomly ordered. In the paper we improve the previous lower bounds on the space required to estimate the frequency moments of a randomly ordered streams.

Affiliated with

Also associated with

No associations

Rating

Better Bounds for Frequency Moments in Random-Order Streams does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Better Bounds for Frequency Moments in Random-Order Streams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Better Bounds for Frequency Moments in Random-Order Streams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-706014