Sciweavers

2232 search results - page 294 / 447
» A Scalable Approach to MPI Application Performance Analysis
Sort
View
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
14 years 9 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 9 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
SAC
2010
ACM
14 years 3 months ago
Extraction of component-environment interaction model using state space traversal
Scalability of software engineering methods can be improved by application of the methods to individual components instead of complete systems. This is, however, possible only if ...
Pavel Parizek, Nodir Yuldashev
IPPS
2007
IEEE
14 years 3 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
ICDCS
2006
IEEE
14 years 3 months ago
Adaptive Control of Extreme-scale Stream Processing Systems
Abstract— Distributed stream processing systems offer a highly scalable and dynamically configurable platform for time-critical applications ranging from real-time, exploratory ...
Lisa Amini, Navendu Jain, Anshul Sehgal, Jeremy Si...