Sciweavers

1040 search results - page 57 / 208
» TCAM-conscious Algorithms for Data Streams
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 9 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
CIDR
2009
139views Algorithms» more  CIDR 2009»
13 years 10 months ago
Inter-Operator Feedback in Data Stream Management Systems via Punctuation
High-volume, high-speed data streams may overwhelm the capabilities of stream processing systems; techniques such as data prioritization, avoidance of unnecessary processing and o...
Rafael Fernández-Moctezuma, Kristin Tufte, ...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 8 months ago
Global Iceberg Detection over Distributed Data Streams
In today's Internet applications or sensor networks we often encounter large amounts of data spread over many physically distributed nodes. The sheer volume of the data and ba...
Ashwin Lall, Haiquan (Chuck) Zhao, Jun Xu, Mitsuno...
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
13 years 15 days ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 9 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy