Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FOCS
1999
IEEE

favoriteEmaildiscussreport

113views Theoretical Computer Science» more FOCS 1999»

An Approximate L1-Difference Algorithm for Massive Data Streams

13 years 9 months ago

An Approximate L1-Difference Algorithm for Massive Data Streams

Download cs-www.cs.yale.edu

Joan Feigenbaum, Sampath Kannan, Martin Strauss, M

Real-time Traffic

FOCS 1999 | Theoretical Computer Science |

claim paper

Related Content

» A Framework for Clustering MassiveDomain Data Streams

» Framework and algorithms for trend analysis in massive temporal data sets

» Range Efficient Computation of F0 over Massive Data Streams

» Fast approximate correlation for massive timeseries data

» Temporal Structure Learning for Clustering Massive Data Streams in RealTime

» A Stream Algorithm for the Decimation of Massive Meshes

» Structureaware sampling on data streams

» Comparing Data Streams Using Hamming Norms How to Zero In

» On distributing symmetric streaming computations

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	FOCS
Authors	Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan

Comments (0)