4940 search results - page 212 / 988 » On the Complexity of Universal Programs |
140
click to vote
LFP
1990
15 years 7 months ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...
148
click to vote
PC
2006
15 years 6 months ago
2006
In this work, we discuss an extension of the set of principles that should guide the future design and development of skeletal programming systems, as defined by Cole in his ``pra...
169
click to vote
FC
2005
Springer
15 years 12 months ago
2005
Springer
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
164
click to vote
SAMOS
2004
Springer
15 years 11 months ago
2004
Springer
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...
184
click to vote
DCG
2008
15 years 6 months ago
2008
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...