CORR
2010
Springer
14 years 9 months ago
2010
Springer
A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
COMGEO
2008
ACM
14 years 9 months ago
2008
ACM
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting ...
AAAI
2004
14 years 10 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
CCCG
2010
14 years 10 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...
PODS
2010
ACM
14 years 10 months ago
2010
ACM
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
We introduce a DPLL calculus that is a decision procedure for the Bernays-Sch
LATIN
1998
Springer
15 years 1 months ago
1998
Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
EH
2000
IEEE
15 years 1 months ago
2000
IEEE
The growth and operation of all living beings are directed by the interpretation, in each of their cells, of a chemical program, the DNA string or genome. This process is the sour...