Sciweavers

84 search results - page 7 / 17
» Approximate quantiles and the order of the stream
Sort
View
PODS
2008
ACM
221views Database» more  PODS 2008»
14 years 7 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ISCI
2006
145views more  ISCI 2006»
13 years 7 months ago
Processing count queries over event streams at multiple time granularities
Management and analysis of streaming data has become crucial with its applications in web, sensor data, network traffic data, and stock market. Data streams consist of mostly nume...
Aykut Ünal, Yücel Saygin, Özgü...
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
11 years 10 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant
DASFAA
2011
IEEE
525views Database» more  DASFAA 2011»
12 years 11 months ago
StreamFitter: A Real Time Linear Regression Analysis System for Continuous Data Streams
In this demo, we present the StreamFitter system for real-time regression analysis on continuous data streams. In order to perform regression on data streams, it is necessary to co...
Chandima H. Nadungodage, Yuni Xia, Fang Li, Jaehwa...
COCOON
2005
Springer
14 years 1 months ago
Finding Longest Increasing and Common Subsequences in Streaming Data
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...
David Liben-Nowell, Erik Vee, An Zhu