Sciweavers

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

80

Voted

SIAMCOMP
2008

favoriteEmaildiscussreport

75views more SIAMCOMP 2008»

Graph Distances in the Data-Stream Model

15 years 10 days ago

Graph Distances in the Data-Stream Model

Download www.cs.umass.edu

Joan Feigenbaum, Sampath Kannan, Andrew McGregor,

Real-time Traffic

SIAMCOMP 2008 |

claim paper

Related Content

» Distance Functions to Detect Changes in Data Streams

» DBODDS Distance Based Outlier Detection for Data Streams

» Towards optimising distributed data streaming graphs using parallel streams

» A Random Method for Quantifying Changing Distributions in Data Streams

» PROUD a probabilistic approach to processing similarity queries over uncertain data stream...

» Annotations in Data Streams

» An Optimal Lower Bound on the Communication Complexity of GapHammingDistance

» Distance graphs from random geometric graphs to Bernoulli graphs and between

» k DistanceHereditary Graphs

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	SIAMCOMP
Authors	Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang 0004

Comments (0)