Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,549 papers from all fields of science
Search
Sign In
Create Free Account
Unary operation
Known as:
Unary
, Unary operator
, Operation
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
41 relations
APL
Admissible rule
Automatic differentiation
BL (logic)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
FPGA implementation of a Deep Belief Network architecture for character recognition using stochastic computation
Kayode A. Sanni
,
Guillaume Garreau
,
J. Molin
,
A. Andreou
Annual Conference on Information Sciences and…
2015
Corpus ID: 12843544
Deep Neural Networks (DNNs) have proven very effective for classification and generative tasks, and are widely adapted in a…
Expand
2010
2010
Ray Markov Random Fields for image-based 3D modeling: Model and efficient inference
Shubao Liu
,
D. Cooper
IEEE Computer Society Conference on Computer…
2010
Corpus ID: 1014194
In this paper, we present an approach to multi-view image-based 3D reconstruction by statistically inversing the ray-tracing…
Expand
Highly Cited
2009
Highly Cited
2009
Mixed-Integer Programming for QoS-Based Web Service Matchmaking
K. Kritikos
,
D. Plexousakis
IEEE Transactions on Services Computing
2009
Corpus ID: 17734937
QoS-based Web service (WS) discovery has been recognized as the main solution for filtering and selecting between functionally…
Expand
2007
2007
On-Line Diagnosis and Recovery: On the Choice and Impact of Tuning Parameters
M. Serafini
,
A. Bondavalli
,
N. Suri
IEEE Transactions on Dependable and Secure…
2007
Corpus ID: 14118344
A sequenced process of Fault Detection followed by the erroneous node's Isolation and system Reconfiguration (node exclusion or…
Expand
2006
2006
ON MODAL LOGICS BETWEEN K×K×K AND S5× S5× S5
R. Hirsch
2006
Corpus ID: 675609
We prove that every n-modal logic between K and S5 is undecidable, whenever n ≥ 3. We also show that each of these logics is non…
Expand
2005
2005
Common pattern discovery using earth mover's distance and local flow maximization
Hung-Khoon Tan
,
C. Ngo
Tenth IEEE International Conference on Computer…
2005
Corpus ID: 13973015
In this paper, we present a novel segmentation-insensitive approach for mining common patterns from 2 images. We develop an…
Expand
Highly Cited
1998
Highly Cited
1998
Design and Analysis of Parametric Query Optimization Algorithms
Sumit Ganguly
Very Large Data Bases Conference
1998
Corpus ID: 18592008
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such as…
Expand
1995
1995
The Complexity of Mean Payoff Games
Uri Zwick
,
M. Paterson
International Computing and Combinatorics…
1995
Corpus ID: 8723422
We study the complexity of finding the values and optimal strategies of mean payoff games, a family of perfect information games…
Expand
Highly Cited
1993
Highly Cited
1993
Theory Interpretation in Simple Type Theory
W. Farmer
Higher-Order Algebra, Logic and Term Rewriting
1993
Corpus ID: 14156134
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in…
Expand
Highly Cited
1989
Highly Cited
1989
Object recognition based on graph matching implemented by a Hopfield-style neural network
W. Li
,
N. Nasrabadi
International Joint Conference on Neural…
1989
Corpus ID: 9560295
A model-based object recognition technique is presented. For each model, distinct features such as curvature points are extracted…
Expand
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)
ACCEPT & CONTINUE