A Higher-Order Approach to Parallel Algorithms
نویسندگان
چکیده
منابع مشابه
A Higher-Order Approach to Parallel Algorithms
A unified approach to the development of algorithms tailored to various classes of parallel computer architecture is presented. The central theme is to identify a small set of higher-order functions that can be implemented efficiently on the target architecture and which can be used to express parallel algorithms in general via mechanised program transformation from some higher-level specificat...
متن کاملA Higher-order Approach to Meta-learning
Meta-learning, as applied to model selection, consists of inducing mappings from tasks to learners. Traditionally, tasks are characterised by the values of pre-computed meta-attributes, such as statistical and information-theoretic measures, induced decision trees' characteristics and/or landmarkers' performances. In this position paper, we propose to (meta-)learn directly from induced decision...
متن کاملHopp - a Higher-order Parallel Programming Model
The eecient programming of parallel computers is still a diicult task. This paper focuses on studying methods for expressing parallelism in programs without making the programmer explicitly responsible for parallelism. Parallel programming using a set of useful implicitly-parallel constructs is considered. These constructs are borrowed from FP and the Bird-Meertens approach. Programs are analys...
متن کاملOn higher-order perceptron algorithms
A new algorithm for on-line learning linear-threshold functions is proposed which efficiently combines second-order statistics about the data with the ”logarithmic behavior” of multiplicative/dual-norm algorithms. An initial theoretical analysis is provided suggesting that our algorithm might be viewed as a standard Perceptron algorithm operating on a transformed sequence of examples with impro...
متن کاملA Multi-level, Higher-order Uniication Approach to Ellipsis
The Higher-Order Uniication approach to ellipsis presented in DSP91] lacks an interface with linguistic modules other than semantics. As a result, it cannot handle such phenomena as the many-pronouns puzzle or the distinction between full and pronominal NPs. In this paper, we extend GK96]'s Higher-Order Coloured Uniication approach to handle those cases.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1992
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/35.6.555