Sciweavers

1805 search results - page 59 / 361
» Functional programming with structured graphs
Sort
View
NIPS
2003
13 years 11 months ago
Kernels for Structured Natural Language Data
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two ste...
Jun Suzuki, Yutaka Sasaki, Eisaku Maeda
ESOP
2000
Springer
14 years 2 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
TII
2010
155views Education» more  TII 2010»
13 years 5 months ago
Refactoring of Execution Control Charts in Basic Function Blocks of the IEC 61499 Standard
-This paper deals with refactoring of execution control charts of IEC 61499 basic function blocks as a means to improve the engineering support potential of the standard in develop...
Valeriy Vyatkin, Victor Dubinin
PASTE
1999
ACM
14 years 2 months ago
Identifying Procedural Structure in Cobol Programs
The principal control-flow abstraction mechanism in the Cobol language is the PERFORM statement. Normally, PERFORM statements are used in a straightforward manner to define para...
John Field, G. Ramalingam
BIRTHDAY
2010
Springer
13 years 11 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman