2343 search results - page 22 / 469 » Structure and Interpretation of Computer Programs |
110
click to vote
CONCUR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...
140
Voted
KDD
1995
ACM
15 years 5 months ago
1995
ACM
Discovering repetitive, interesting, and functional substructures in a structural database improves the ability to interpret and compress the data. However, scientists working wit...
108
click to vote
IEEESCC
2008
IEEE
15 years 8 months ago
2008
IEEE
Interpreting legacy XML documents is a great challenge for realizing the vision of the Semantic Web (SW). This paper presents an algorithm to transform XML data into RDF- foundati...
103
Voted
ACL
2010
15 years 12 days ago
2010
Once released, treebanks tend to remain unchanged despite any shortcomings in their depth of linguistic analysis or coverage of specific phenomena. Instead, separate resources are...
116
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...