Skip to search formSkip to main contentSkip to account menu

Idempotence

Known as: Idempotence (computer science), Idempotent, Idempotent function 
Idempotence (/ˌaɪdᵻmˈpoʊtəns/ EYE-dəm-POH-təns) is the property of certain operations in mathematics and computer science, that can be applied… 
Wikipedia (opens in a new tab)

Related topics

Related topics

37 relations
Basis (linear algebra)Bell polynomialsBoolean algebraComputer science

Broader (1)

Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
On the diversity order of transmit antenna selection for spatial multiplexing systems
In the context of antenna selection for MIMO diversity systems, the problem of optimal diversity order is well addressed. On the… 
2004
2004
Locality and Adjacency Stability Constraints for Morphological Connected Operators
This paper investigates two constraints for the connected operator class. For binary images, connected operators are those that… 
2003
2003
‘ Fuzzy ’ vs ‘ Non-fuzzy ’ in Combining Classifiers Designed by Boosting
Boosting is recognized as one of the most successful techniques for generating classifier ensembles. Typically, the classifier… 
2001
2001
Dual mesh resampling
  • G. Taubin
  • Proceedings Ninth Pacific Conference on Computer…
  • 2001
  • Corpus ID: 167744
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but… 
1999
1999
Separability and Hopf algebras
1. Introduction Over a eld of characteristic zero, the separable algebras and the strongly separable algebras coincide with one… 
Highly Cited
1998
Highly Cited
1998
Countable linear transformations are clean
It is shown that every linear transformation on a vector space of countable dimension is the sum of a unit and an idempotent. An… 
1995
1995
Analysis of the properties of soft morphological filtering using threshold decomposition
We present the properties of soft morphological operations and the new definitions of binary soft morphological operations. It is… 
1992
1992
A new set of fast algorithms for mathematical morphology : II. Identification of topographic features on grayscale images
1989
1989
Construction of regular semigroups with inverse transversals
Let S be a regular semigroup. An inverse subsemigroup S° of S is an inverse transversal if |V(x)∩S°| = 1 for each x∈S, where V(x… 
Highly Cited
1971
Highly Cited
1971
Inner ideals in quadratic Jordan algebras
The inner ideals play a role in the theory of quadratic Jordan algebras analogous to that played by the one-sided ideals in the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)