27 search results - page 6 / 6 » Minimum Clique Partition in Unit Disk Graphs |
SWAT
2010
Springer
14 years 3 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
ICPR
2002
IEEE
14 years 12 months ago
2002
IEEE
Color and color neighborhood statistics have been used extensively in image matching and retrieval. However, the effective incorporation of color layout information remains a chal...