Sciweavers

257 search results - page 9 / 52
» An Approximate L1-Difference Algorithm for Massive Data Stre...
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
Paul Beame, Dang-Trinh Huynh-Ngoc
PAMI
2010
119views more  PAMI 2010»
14 years 8 months ago
Efficient Multilevel Eigensolvers with Applications to Data Analysis Tasks
—Multigrid solvers proved very efficient for solving massive systems of equations in various fields. These solvers are based on iterative relaxation schemes together with the app...
Dan Kushnir, Meirav Galun, Achi Brandt
PODS
2005
ACM
131views Database» more  PODS 2005»
15 years 9 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
81
Voted
DAWAK
2008
Springer
14 years 11 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 9 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...