1480 search results - page 29 / 296 » Distributed algorithms for weighted problems in sparse graph... |
110
Voted
STOC
2000
ACM
15 years 5 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
110
click to vote
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
95
Voted
AAAI
2007
15 years 3 months ago
2007
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this pa...
129
click to vote
PAMI
2007
15 years 10 days ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
141
click to vote
ALT
2011
Springer
14 years 25 days ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...