2168 search results - page 217 / 434 » Randomized Algorithms and Complexity Theory |
143
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
130
Voted
JCC
2002
15 years 3 months ago
2002
: Generalized Born (GB) models provide, for many applications, an accurate and computationally facile estimate of the electrostatic contribution to aqueous solvation. The GB models...
128
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
135
click to vote
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
248
Voted
POPL
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...