999 search results - page 57 / 200 » Warping the time on data streams |
ICDE
2008
IEEE
15 years 16 days ago
2008
IEEE
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
ICDT
2009
ACM
14 years 12 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
SOFSEM
2010
Springer
14 years 8 months ago
2010
Springer
Preference queries have received considerable attention in the recent past, due to their use in selecting the most preferred objects, especially when the selection criteria are con...
AUSAI
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
VLDB
2004
ACM
14 years 4 months ago
2004
ACM
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...