4378 search results - page 208 / 876 » On the Complexity of Ordered Colourings |
178
click to vote
ICIP
2003
IEEE
15 years 12 months ago
2003
IEEE
We propose a novel algorithm to compute Voronoi diagrams of order k in arbitrary 2D and 3D domains. The algorithm is based on a fast ordered propagation distance transformation ca...
156
click to vote
SSDBM
2010
IEEE
15 years 11 months ago
2010
IEEE
We present a technique for organizing data in spatial databases with non-convex domains based on an automatic characterization using the medial-axis transform (MAT). We define a t...
174
click to vote
ICSM
1994
IEEE
15 years 10 months ago
1994
IEEE
In order to improve software maintenance processes, we need to be able to first characterize and assess them. This task needs to be performed in depth and with objectivity since t...
167
click to vote
CCCG
2010
15 years 8 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
129
click to vote
APAL
2008
15 years 6 months ago
2008
We study and compare two combinatorial lowness notions: strong jump-traceability and well-approximability of the jump, by strengthening the notion of jump-traceability and super-l...