41 search results - page 4 / 9 » An axiomatization of family resemblance |
101
Voted
AMAST
1991
Springer
15 years 28 days ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
TPHOL
1999
IEEE
15 years 1 months ago
1999
IEEE
The standard versions of HOL only support disjoint sums over finite families of types. This paper introduces disjoint sums over type classes containing possibly a countably infinit...
RELMICS
1998
Springer
15 years 1 months ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
Diffusion-type algorithms have been integrated in recent years successfully into the toolbox of image processing. We introduce a new more flexible and powerful family of parabolic...
108
click to vote
JMIV
1998
14 years 9 months ago
1998
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...