Results 251 to 260 of about 2,753 (280)
Generalized 5-Point Approximating Subdivision Scheme of Varying Arity
Mathematics, 2020 The Subdivision Schemes (SSs) have been the heart of Computer Aided Geometric Design (CAGD) almost from its origin, and various analyses of SSs have been conducted.
Sardar Muhammad Hussain +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Intelligent & Fuzzy Systems, 2021
The arity of convex spaces is a numerical feature which shows the ability of finite subsets spanning to the whole space via the hull operators. This paper gives it a formal and strict definition by introducing the truncation of convex spaces. The relations that between the arity of quotient spaces and the original spaces, that between the arity of ...
Wei Yao, Ye Chen
openaire +1 more source
The arity of convex spaces is a numerical feature which shows the ability of finite subsets spanning to the whole space via the hull operators. This paper gives it a formal and strict definition by introducing the truncation of convex spaces. The relations that between the arity of quotient spaces and the original spaces, that between the arity of ...
Wei Yao, Ye Chen
openaire +1 more source
Generalizations of Świerczkowski’s lemma and the arity gap of finite functions
Discrete Mathematics, 2009 peer reviewedŚwierczkowski’s lemma–as it is usually formulated–asserts that if f:Aⁿ→A is an operation on a finite set A, n≥4, and every operation obtained from f by identifying a pair of variables is a projection, then f is a semiprojection.
MIGUEL Couceiro, Erkko Lehtonen
exaly +2 more sources
A variable-arity procedural interface
Proceedings of the 1988 ACM conference on LISP and functional programming, 1988This paper presents a procedural interface that handles optional arguments and indefinite numbers of arguments in a convenient and efficient manner without resorting to storing the arguments in a language-dependent data structure. This interface solves many of the problems inherent in the use of lists to store indefinite numbers of arguments.
R. Kent Dybvig, Robert Hieb
openaire +1 more source
Computer Languages, Systems & Structures, 2014
Higher order combinators in functional programming languages can lead to code that would be considerably more efficient if some functions' definitions were eta-expanded, but the existing analyses are not always precise enough to allow that. In particular, this has prevented foldl from efficiently taking part in list fusion.
openaire +2 more sources
Higher order combinators in functional programming languages can lead to code that would be considerably more efficient if some functions' definitions were eta-expanded, but the existing analyses are not always precise enough to allow that. In particular, this has prevented foldl from efficiently taking part in list fusion.
openaire +2 more sources
Exploring the effect of LUT and arity size on a tree-based application specific inflexible FPGA
, 2011 International audienceAn application specific inflexible FPGA (ASIF) is an FPGA with reduced flexibility and improved density. An ASIF is reduced from an FPGA for a predefined set of applications that operate at mutually exclusive times.
Umer Farooq +2 more
exaly +2 more sources
Centralizing Monoids and the Arity of Witnesses
2017 IEEE 47th International Symposium on Multiple-Valued Logic (ISMVL), 2017Multi-variable functions defined over a fixed finite set A are considered. A centralizing monoid M is a set of unary functions on A which commute with all members of some set F of functions on A. The set F is called a witness of M. We show that every centralizing monoid has a witness whose arity does not exceed |A|.
Hajime Machida, Ivo G. Rosenberg
openaire +1 more source
On the real arity of multiparent recombination
Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 2003Several papers have reported experimental results for multiparent recombination operators, looking at the effects of using more parents. Tacitly, these studies assume that the number of parents (the arity of the given recombination operator) tells how many old individuals contribute to a new one by passing their genetic information to it.
Ida G. Sprinkhuizen-Kuyper +2 more
openaire +1 more source
Concrete Dualities and Essential Arities
2014 IEEE 44th International Symposium on Multiple-Valued Logic, 2014Many dualities arise in the same way: they are induced by dualizing objects. We show that these dualities are connected to a question occurring in universal algebra. Indeed, they cause a strong interplay between the essential arity of finitary operations in one category and the concrete form of the copowers in the other. We elaborate on this connection
openaire +2 more sources
Proceedings of the third ACM SIGPLAN international conference on Functional programming, 1998
Arity raising, also known as variable splitting or flattening, is the program optimization which transforms a function of one argument into a function of several arguments by decomposing the structure of the original one argument into individual components in that structure.
John Hannan, Patrick Hicks
openaire +1 more source
Arity raising, also known as variable splitting or flattening, is the program optimization which transforms a function of one argument into a function of several arguments by decomposing the structure of the original one argument into individual components in that structure.
John Hannan, Patrick Hicks
openaire +1 more source