1146 search results - page 35 / 230 » Finite cupping sets |
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
CCCG
2010
13 years 9 months ago
2010
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
EJC
2008
13 years 7 months ago
2008
Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
PRL
2006
13 years 7 months ago
2006
Various types of moments have been used to recognize image patterns in a number of applications. However, only few works have paid attention to the completeness property of the in...
JGT
2008
13 years 7 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...