76 search results - page 8 / 16 » Finding a Large Hidden Clique in a Random Graph |
SIAMJO
2010
13 years 2 months ago
2010
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...