Sciweavers

2503 search results - page 183 / 501
» A study of 3-arc graphs
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 7 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
KDD
2003
ACM
152views Data Mining» more  KDD 2003»
16 years 7 months ago
Interactive exploration of coherent patterns in time-series gene expression data
Discovering coherent gene expression patterns in time-series gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we pr...
Daxin Jiang, Jian Pei, Aidong Zhang
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 6 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
WSDM
2010
ACM
254views Data Mining» more  WSDM 2010»
16 years 4 months ago
Learning Influence Probabilities In Social Networks
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
Amit Goyal 0002, Francesco Bonchi, Laks V. S. Laks...
ICS
2010
Tsinghua U.
16 years 4 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns