104 search results - page 21 / 21 » Tight Bounds for Point Recolouring |
SWAT
1998
Springer
13 years 9 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
INFOCOM
2009
IEEE
13 years 12 months ago
2009
IEEE
Abstract—The advent of practical rateless codes enables implementation of highly efficient packet-level forward error correction (FEC) strategies for reliable data broadcasting ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
COLT
2001
Springer
13 years 9 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...