Sciweavers

134 search results - page 5 / 27
» Sliding-Window Filtering: An Efficient Algorithm for Increme...
Sort
View
TSP
2010
13 years 2 months ago
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform
Fast algorithms for computing the forward and inverse sequency-ordered complex Hadamard transforms (SCHT) in a sliding window are presented. The first algorithm consists of decompo...
Jiasong Wu, Huazhong Shu, Lu Wang, Lotfi Senhadji
SCN
2008
Springer
136views Communications» more  SCN 2008»
13 years 7 months ago
An efficient data structure for network anomaly detection
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...
Jieyan Fan, Dapeng Wu, Kejie Lu, Antonio Nucci
DASFAA
2010
IEEE
225views Database» more  DASFAA 2010»
13 years 7 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,...
DKE
2010
101views more  DKE 2010»
13 years 7 months ago
An efficient algorithm for incremental mining of temporal association rules
Tarek F. Gharib, Hamed Nassar, Mohamed Taha, Ajith...
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
13 years 11 months ago
An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases
Efficient discover of association rules in large databases is a we 1 studied problem and several ap-1y proaches have been proposed. However, it is non trivial to maintain the asso...
Shiby Thomas, Sreenath Bodagala, Khaled Alsabti, S...