Sciweavers

223 search results - page 23 / 45
» Approximate Frequency Counts over Data Streams
Sort
View
CIKM
2004
Springer
15 years 3 months ago
Framework and algorithms for trend analysis in massive temporal data sets
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
Sreenivas Gollapudi, D. Sivakumar
DASFAA
2010
IEEE
225views Database» more  DASFAA 2010»
14 years 10 months ago
Mining Regular Patterns in Data Streams
Discovering interesting patterns from high-speed data streams is a challenging problem in data mining. Recently, the support metric-based frequent pattern mining from data stream h...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
99
Voted
ICIP
2002
IEEE
15 years 11 months ago
Effects of channel delays on underflow events of compressed video over the Internet
This paper presents an extensive statistical study and analysis of the effects of channel delays in the current (best-effort) Internet on underflow events in MPEG-4 video streamin...
Dmitri Loguinov, Hayder Radha
PODS
2006
ACM
134views Database» more  PODS 2006»
15 years 9 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
ICDT
2001
ACM
153views Database» more  ICDT 2001»
15 years 2 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...