## Search

Now showing items 1-10 of 10

#### Trying to find the golden thread in my research from 1987 to 2011

(Stellenbosch : Stellenbosch University, 2011-10)

Marcel Maria Wolfgang Wild was born on 17 July 1958 in Bern (Switzerland).
After matriculating from the Gymnasium Rämibühl in Zürich in
1977 he studied Mathematics, Computer Science and (to a lesser degree)
Philosophy ...

#### Computing the output distribution of a stack filter from the DNF of its positive Boolean function

(Cornell University Library, 2010)

ENGLISH ABSTRACT: The majority of nonlinear filters used in practise are stack filters. An algorithm is
presented which calculates the output distribution of an arbitrary stack filter S from the disjunctive
normal form ...

#### Compactly generating all satisfying truth assignments of a horn formula

(Delft University in cooperation with IOS Press, 2012-01)

ENGLISH ABSTRACT: While it was known that all models of a Horn formula can be generated in outputpolynomial time, here we present an explicit algorithm as opposed to the rather vague oracle-scheme suggested in the proof ...

#### The asymptotic number of binary codes and binary matroids

(Society for Industrial and Applied Mathematics (SIAM), 2006-08)

The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary matroids on n elements.

#### Realization of abstract convex geometries by point configurations

(Elsevier, 2010-01)

The Edelman-Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. We show that some natural modification of the Edelman-Jamison problem is equivalent ...

#### Decomposing the hypercube Qn into n isomorphic edge-disjoint trees

(Elsevier, 2012-02)

The problem of finding edge-disjoint trees in a hypercube arises for example in the context of parallel computing [3].
Independently of applications it is of high aesthetic appeal. The hypercube of dimension n, denoted ...

#### Partitioning the hypercube Qn into n isomorphic edge-disjoint trees

(TU Graz University of Technology, 2011)

ENGLISH ABSTRACT: The problem of finding edge-disjoint trees in a hypercube e.g. arises in the context of
parallel computing. Independent of applications it is of high aesthetic appeal.

#### Computing various types of lattices freely generated by posets

(Edizioni CERFIM Centro di Ricerche in Fisica e MatematicaResearch Center for Mathematics and Physics - Locarno - Switzerland, 2000)

see item for abstract

#### Trying to find the golden thread in my research from 1987 to 2011

(Stellenbosch : Stellenbosch University, 2011-10)

This booklet will highlight some of the mathematics I did after (and during) my PhD that was awarded in 1987. The chosen topics nevertheless constitute a sizeable "transversal" (to use mathematical parlance) of the fields ...

#### Calculating the output distribution of stack filters that are erosion-dilation cascades, in particular LULU-filters

(Cornell University Library, 2011)

ENGLISH ABSTRACT: Two procedures to compute the output distribution 0S of certain stack filters S (so
called erosion-dilation cascades) are given. One rests on the disjunctive normal form of S
and also yields the rank ...