185 search results - page 1 / 37 » Local Algorithms for Finding Interesting Individuals in Larg... |
ICS
2010
Tsinghua U.
14 years 1 months ago
2010
Tsinghua U.
: 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...
SIGMOD
2004
ACM
14 years 4 months ago
2004
ACM
Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most e...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
FCSC
2007
13 years 4 months ago
2007
The discovery of community structure in a large number of complex networks has attracted lots of interest in recent years. One category of algorithms for detecting community struct...
BMCBI
2010
13 years 4 months ago
2010
Background: There is increasing interest in the development of computational methods to analyze fluorescent microscopy images and enable automated large-scale analysis of the subc...