2693 search results - page 18 / 539 » On Computing Complex Navigation Functions |
APL
1998
ACM
14 years 2 months ago
1998
ACM
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
IJCAI
2003
13 years 11 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
CSR
2011
Springer
13 years 1 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
TSP
2008
13 years 9 months ago
2008
We introduce a framework based on Wirtinger calculus for nonlinear complex-valued signal processing such that all computations can be directly carried out in the complex domain. Th...
ISLPED
1996
ACM
14 years 2 months ago
1996
ACM
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...