Sciweavers

107 search results - page 8 / 22
» Tight Results on Minimum Entropy Set Cover
Sort
View
CORR
2011
Springer
234views Education» more  CORR 2011»
13 years 2 months ago
Mutual Information, Relative Entropy, and Estimation in the Poisson Channel
Let X be a non-negative random variable and let the conditional distribution of a random variable Y , given X, be Poisson(γ · X), for a parameter γ ≥ 0. We identify a natural...
Rami Atar, Tsachy Weissman
CGF
2006
125views more  CGF 2006»
13 years 7 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
ISAAC
2009
Springer
116views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
Francisco Claude, Reza Dorrigiv, Stephane Durocher...
FOCS
2005
IEEE
14 years 1 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
13 years 11 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev