439 search results - page 66 / 88 » Choiceless Computation and Symmetry |
100
click to vote
AISC
2008
Springer
14 years 11 months ago
2008
Springer
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
SGP
2003
14 years 11 months ago
2003
Previous parametric representations of smooth genus-zero surfaces require a collection of abutting patches (e.g. splines, NURBS, recursively subdivided polygons). We introduce a s...
DAC
1994
ACM
15 years 1 months ago
1994
ACM
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
JAR
1998
14 years 9 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
78
Voted
ICPR
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper deals with the construction of a non parametric multiscale analysis from a 1D parametric decomposition of shapes where the elements of the decomposition are geometric p...