Sciweavers

2503 search results - page 258 / 501
» A study of 3-arc graphs
Sort
View
SAC
2008
ACM
15 years 5 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
CIKM
2010
Springer
15 years 4 months ago
Understanding retweeting behaviors in social networks
Retweeting is an important action (behavior) on Twitter, indicating the behavior that users re-post microblogs of their friends. While much work has been conducted for mining text...
Zi Yang, Jingyi Guo, Keke Cai, Jie Tang, Juanzi Li...
IGPL
2010
109views more  IGPL 2010»
15 years 4 months ago
Deductive coherence and norm adoption
This paper is a contribution to the formalisation of Thagard’s coherence theory. The term coherence is defined as the quality or the state of cohering, especially a logical, ord...
Sindhu Joseph, Carles Sierra, W. Marco Schorlemmer...
IJBIDM
2010
80views more  IJBIDM 2010»
15 years 4 months ago
Practical algorithms for subgroup detection in covert networks
: In this paper, we present algorithms for subgroup detection and demonstrated them with a real-time case study of USS Cole bombing terrorist network. The algorithms are demonstrat...
Nasrullah Memon, Uffe Kock Wiil, Abdul Rasool Qure...
156
Voted
JCT
2010
114views more  JCT 2010»
15 years 4 months ago
An almost quadratic bound on vertex Folkman numbers
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
Andrzej Dudek, Vojtech Rödl