Sciweavers

208 search results - page 36 / 42
» Improved upper bounds on the crossing number
Sort
View
ICCV
2009
IEEE
15 years 10 days ago
Time-Constrained Photography
Capturing multiple photos at different focus settings is a powerful approach for reducing optical blur, but how many photos should we capture within a fixed time budget? We develop...
Samuel W. Hasinoff, Kiriakos N. Kutulakos, Frédo ...
FOCS
2006
IEEE
14 years 1 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
COCO
2005
Springer
96views Algorithms» more  COCO 2005»
14 years 27 days ago
A Geometric Approach to Information-Theoretic Private Information Retrieval
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...
David P. Woodruff, Sergey Yekhanin
DATE
2010
IEEE
181views Hardware» more  DATE 2010»
14 years 14 days ago
Temperature-aware dynamic resource provisioning in a power-optimized datacenter
- The current energy and environmental cost trends of datacenters are unsustainable. It is critically important to develop datacenter-wide power and thermal management (PTM) soluti...
Ehsan Pakbaznia, Mohammad Ghasemazar, Massoud Pedr...
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
13 years 11 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...