Sciweavers

2226 search results - page 326 / 446
» Scalable Trigger Processing
Sort
View
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
16 years 6 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
16 years 6 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
16 years 6 months ago
Weighted Association Rule Mining using weighted support and significance framework
We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to han...
Feng Tao, Fionn Murtagh, Mohsen Farid
CHI
2005
ACM
16 years 6 months ago
A method to standardize usability metrics into a single score
Current methods to represent system or task usability in a single metric do not include all the ANSI and ISO defined usability aspects: effectiveness, efficiency & satisfactio...
Jeff Sauro, Erika Kindlund
HPCA
2006
IEEE
16 years 6 months ago
Software-hardware cooperative memory disambiguation
In high-end processors, increasing the number of in-flight instructions can improve performance by overlapping useful processing with long-latency accesses to the main memory. Buf...
Ruke Huang, Alok Garg, Michael C. Huang