631 search results - page 53 / 127 » Additive Approximation for Edge-Deletion Problems |
CGF
2010
13 years 10 months ago
2010
We present a closed-form solution for the symmetrization problem, solving for the optimal deformation that reconciles a set of local bilateral symmetries. Given as input a set of ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
APPROX
2009
Springer
14 years 4 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
ACL
2008
13 years 11 months ago
2008
Researchers typically evaluate word prediction using keystroke savings, however, this measure is not straightforward. We present several complications in computing keystroke savin...