Skip to search formSkip to main contentSkip to account menu

Unary operation

Known as: Unary, Unary operator, Operation 
In mathematics, a unary operation is an operation with only one operand, i.e. a single input. An example is the function f : A → A, where A is a set… 
Wikipedia (opens in a new tab)

Related topics

Related topics

41 relations
APLAdmissible ruleAutomatic differentiationBL (logic)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Higher accuracy and lower run time: efficient mutation analysis using non‐redundant mutation operators
Mutation analysis is a powerful but computationally expensive method to measure the effectiveness of a testing or debugging… 
2015
2015
FPGA implementation of a Deep Belief Network architecture for character recognition using stochastic computation
Deep Neural Networks (DNNs) have proven very effective for classification and generative tasks, and are widely adapted in a… 
Highly Cited
2009
Highly Cited
2009
Mixed-Integer Programming for QoS-Based Web Service Matchmaking
QoS-based Web service (WS) discovery has been recognized as the main solution for filtering and selecting between functionally… 
Highly Cited
2007
Highly Cited
2007
Solving Numerical NP-Complete Problems with Spiking Neural P Systems
Starting from an extended nondeterministic spiking neural P system that solves the Subset SUM problem in a constant number of… 
2007
2007
On-Line Diagnosis and Recovery: On the Choice and Impact of Tuning Parameters
A sequenced process of Fault Detection followed by the erroneous node's Isolation and system Reconfiguration (node exclusion or… 
2007
2007
Semantic QoS-based Web Service Discovery Algorithms
The success of the Web Service (WS) paradigm has led to a proliferation of available WSs, which are advertised in WS registries… 
2005
2005
Common pattern discovery using earth mover's distance and local flow maximization
In this paper, we present a novel segmentation-insensitive approach for mining common patterns from 2 images. We develop an… 
Highly Cited
1998
Highly Cited
1998
Design and Analysis of Parametric Query Optimization Algorithms
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such as… 
1996
1996
On Winning Strategies with Unary Quantifiers
A combinatorial argument for two nite structures to agree on all sentences with bounded quantiier rank in rst-order logic with… 
Highly Cited
1989
Highly Cited
1989
Object recognition based on graph matching implemented by a Hopfield-style neural network
A model-based object recognition technique is presented. For each model, distinct features such as curvature points are extracted… 
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)