Search
ChatPaper
AI Writing
analysis
Analysis
编组
Open Data
more
More
RankingsMust ReadingJournal&ConferenceAI TRAI HistoryMaster Reading TreeXiaomai's Star TalentsTrajectoryTalentNDI TrackerOpenAI sign Language
VIPCreated with Sketch.

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

Prosenjit Bose,Evangelos Kranakis,Pat Morin,Yihui Tang

msra

Cited 23|Views3
No score
Abstract
We consider the problem of approximating the frequency of frequently occuring elements in a stream of length n using only a memory of size m n.
More
Translated text
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined