13 search results - page 2 / 3 » Acyclic colorings of products of trees |
DAGSTUHL
2008
13 years 6 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
DAM
2007
13 years 5 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
WG
2010
Springer
13 years 3 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
IEEEMM
2002
13 years 5 months ago
2002
measuring the product's "lower abstraction attributes."5 We see attributes as measurable properties of an entity--here, a Web application--and propose using a qualit...