Sciweavers

2126 search results - page 213 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
16 years 24 days ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
FOCS
1999
IEEE
15 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
16 years 7 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
PC
2007
133views Management» more  PC 2007»
15 years 6 months ago
Data distribution for dense factorization on computers with memory heterogeneity
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
Alexey L. Lastovetsky, Ravi Reddy
BMCBI
2005
115views more  BMCBI 2005»
15 years 6 months ago
Statistical distributions of optimal global alignment scores of random protein sequences
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
Hongxia Pang, Jiaowei Tang, Su-Shing Chen, Shiheng...