3818 search results - page 703 / 764 » Learning from Order Examples |
117
click to vote
MFCS
1998
Springer
15 years 6 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
137
click to vote
VISUALIZATION
1994
IEEE
15 years 6 months ago
1994
IEEE
We will try to address the need for a formal foundation for visualization by taking an analytic approach to defining D. Since an arbitrary function D: U V will not produce display...
100
click to vote
NIXDORF
1992
15 years 6 months ago
1992
We present some quantitative performance measurements for the computing power of Programmable Active Memories (PAM), as introduced by [2]. Based on Field Programmable Gate Array (...
121
Voted
ERSHOV
1989
Springer
15 years 6 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
122
click to vote
MPC
2010
Springer
15 years 6 months ago
2010
Springer
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...