40 search results - page 7 / 8 » New bounds on a hypercube coloring problem |
ICCV
1998
IEEE
14 years 7 months ago
1998
IEEE
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
SI3D
2006
ACM
13 years 11 months ago
2006
ACM
Shadow maps are a widely used shadowing technique in real time graphics. One major drawback of their use is that they cannot be filtered in the same way as color textures, typica...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...