Displaying similar documents to “The complexity of retina operators.”

Cubical approximation and computation of homology

William Kalies, Konstantin Mischaikow, Greg Watson (1999)

Banach Center Publications

Similarity:

The purpose of this article is to introduce a method for computing the homology groups of cellular complexes composed of cubes. We will pay attention to issues of storage and efficiency in performing computations on large complexes which will be required in applications to the computation of the Conley index. The algorithm used in the homology computations is based on a local reduction procedure, and we give a subquadratic estimate of its computational complexity. This estimate is rigorous...

Singles in a Markov chain.

Omey, Edward, Van Gulck, Stefan (2008)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Finite Symmetric Functions with Non-Trivial Arity Gap

Shtrakov, Slavcho, Koppitz, Jörg (2012)

Serdica Journal of Computing

Similarity:

Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty...