Sciweavers

630 search results - page 93 / 126
» Hardness results for approximating the bandwidth
Sort
View
VEE
2012
ACM
322views Virtualization» more  VEE 2012»
14 years 1 months ago
Modeling virtualized applications using machine learning techniques
With the growing adoption of virtualized datacenters and cloud hosting services, the allocation and sizing of resources such as CPU, memory, and I/O bandwidth for virtual machines...
Sajib Kundu, Raju Rangaswami, Ajay Gulati, Ming Zh...
FOCS
2004
IEEE
15 years 10 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
BMCBI
2006
143views more  BMCBI 2006»
15 years 6 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 6 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 10 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani