95 search results - page 7 / 19 » Improved Exact Algorithms for Counting 3- and 4-Colorings |
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of selecting k skyline points so that the number of points,...
DAM
2011
13 years 2 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
COCO
2004
Springer
14 years 25 days ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
AAECC
2007
Springer
14 years 1 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...