Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
We present a novel method for accurate marker-less capture of articulated skeleton motion of several subjects in general scenes… Expand
  • figure 1
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We introduce an online learning approach for multitarget tracking. Detection responses are gradually associated into tracklets in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We show that a finite algebra has a Taylor operation if and only if it has an operation satisfying a particular set of 6-ary… Expand
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Computer vision algorithms for individual tasks such as object recognition, detection and segmentation have shown impressive… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The paper investigates XML document specifications with DTDs and integrity constraints, such as keys and foreign keys. We study… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
It is shown that BPP can be simulated in subexponential time for infinitely many input lengths unless exponential time collapses… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The article [1] provides the terminology and notation for this paper. For simplicity we adopt the following convention: x will… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A brief outline of the categorical characterisation of Girard's linear logic is given, analagous to the relationship between… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Abstract We prove that O(e √ n log n ) states are sufficient to simulate an n -state 1nfa recognizing a unary language by a 1dfa… Expand
  • figure 1
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Let be a finite set of (nonlogical) predicate symbols. By an -structure, we mean a relational structure appropriate for . Let be… Expand
Is this relevant?