Sciweavers

2503 search results - page 203 / 501
» A study of 3-arc graphs
Sort
View
SDM
2011
SIAM
230views Data Mining» more  SDM 2011»
14 years 9 months ago
Multidimensional Association Rules in Boolean Tensors
Popular data mining methods support knowledge discovery from patterns that hold in binary relations. We study the generalization of association rule mining within arbitrary n-ary ...
Kim-Ngan Nguyen, Loïc Cerf, Marc Plantevit, J...
CIKM
2011
Springer
14 years 6 months ago
Content-driven detection of campaigns in social media
We study the problem of detecting coordinated free text campaigns in large-scale social media. These campaigns – ranging from coordinated spam messages to promotional and advert...
Kyumin Lee, James Caverlee, Zhiyuan Cheng, Daniel ...
IPPS
1998
IEEE
15 years 11 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot
COLOGNETWENTE
2009
15 years 7 months ago
Acyclic and Frugal Colourings of Graphs
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
Ross J. Kang, Tobias Müller
BIOINFORMATICS
2007
83views more  BIOINFORMATICS 2007»
15 years 6 months ago
Exploring biological network structure using exponential random graph models
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
Zachary M. Saul, Vladimir Filkov