Sciweavers

4009 search results - page 313 / 802
» Clustering on Complex Graphs
Sort
View
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 6 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 6 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
BMCBI
2010
120views more  BMCBI 2010»
15 years 6 months ago
Examination of the relationship between essential genes in PPI network and hub proteins in reverse nearest neighbor topology
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...
Kang Ning, Hoong Kee Ng, Sriganesh Srihari, Hon Wa...
155
Voted
CVPR
2000
IEEE
16 years 8 months ago
Image Segmentation by Nested Cuts
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...
Olga Veksler
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