257 search results - page 25 / 52 » An Approximate L1-Difference Algorithm for Massive Data Stre... |
120
Voted
JDCTA
2010
14 years 4 months ago
2010
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
102
click to vote
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...