961 search results - page 131 / 193 » Significance-Driven Graph Clustering |
152
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
144
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: In many protein-protein interaction (PPI) networks, densely connected hub proteins are more likely to be essential proteins. This is referred to as the "centralit...
120
click to vote
CVPR
2000
IEEE
16 years 6 months ago
2000
IEEE
We present a new image segmentation algorithm based on graph cuts. Our main tool is separation of each pixel from a special point outside the image by a cut of a minimum cost. Suc...
131
click to vote
ICS
2010
Tsinghua U.
16 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...
155
click to vote
CVPR
2010
IEEE
16 years 20 days ago
2010
IEEE
We present a method to segment a collection of unlabeled images while exploiting automatically discovered appearance patterns shared between them. Given an unlabeled pool of multi...