82 search results - page 9 / 17 » Dynamically maintaining frequent items over a data stream |
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
87
Voted
ASC
2008
14 years 9 months ago
2008
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
101
click to vote
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
In today’s world, stream processing systems have become important, as applications like media broadcasting, sensor network monitoring and on-line data analysis increasingly rely...
SIGMETRICS
2008
ACM
14 years 9 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
STOC
2005
ACM
15 years 3 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...