Sciweavers

2487 search results - page 260 / 498
» cases 2009
Sort
View
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 7 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 7 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
16 years 7 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
RECOMB
2009
Springer
16 years 7 months ago
Simultaneous Alignment and Folding of Protein Sequences
Abstract. Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding ...
Bonnie Berger, Charles W. O'Donnell, Jér&oc...
RECOMB
2009
Springer
16 years 7 months ago
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...
Saket Navlakha, James Robert White, Niranjan Nagar...