Sciweavers

4542 search results - page 74 / 909
» Design patterns for data structures
Sort
View
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
15 years 2 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig
124
Voted
ICML
1996
IEEE
16 years 3 months ago
Searching for Structure in Multiple Streams of Data
Finding structure in multiple streams of data is an important problem. Consider the streams of data owing from a robot's sensors, the monitors in an intensive care unit, or p...
Tim Oates, Paul R. Cohen
ICDE
2007
IEEE
117views Database» more  ICDE 2007»
16 years 3 months ago
Clustering wavelets to speed-up data dissemination in structured P2P MANETs
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...
Mihai Lupu, Jianzhong Li, Beng Chin Ooi, Shengfei ...
ESOP
2006
Springer
15 years 6 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner
IPPS
2010
IEEE
15 years 10 days ago
Head-body partitioned string matching for Deep Packet Inspection with scalable and attack-resilient performance
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
Yi-Hua E. Yang, Viktor K. Prasanna, Chenqian Jiang