Sciweavers

1208 search results - page 60 / 242
» Uniform eventown problems
Sort
View
SIAMCOMP
2011
14 years 1 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
95
Voted
FOCS
2000
IEEE
15 years 2 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
84
Voted
LPAR
2005
Springer
15 years 3 months ago
Algebraic Intruder Deductions
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
David A. Basin, Sebastian Mödersheim, Luca Vi...
99
Voted
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
15 years 1 months ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
CBMS
1995
IEEE
15 years 1 months ago
Validation of a Large Medical Database
Complex clinical problems involving huge experimental evidence require a preliminary validation of observed data. This may avoid biasing due to incorrect sampling and clarify the ...
Guido Rovetta, Patrizia Monteforte, Gerolamo Bianc...