1951 search results - page 142 / 391 » An algorithm for improving graph partitions |
125
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
151
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
160
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
136
Voted
WALCOM
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
174
Voted
WAW
2004
Springer
15 years 10 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...