1542 search results - page 193 / 309 » The metamathematics of random graphs |
109
Voted
ICML
2005
IEEE
16 years 2 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...
112
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
130
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
101
Voted
ICDM
2006
IEEE
15 years 7 months ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
108
click to vote
ICDM
2005
IEEE
15 years 7 months ago
2005
IEEE
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...