562 search results - page 19 / 113 » Ordered Sets in the Calculus of Data Structures |
86
Voted
FIMI
2003
14 years 11 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
TAPSOFT
1993
Springer
15 years 1 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
69
Voted
ICCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. BSML is a library for parallel programming with the functional language Objective Caml. It is based on an extension of the λcalculus by parallel operations on a parallel...
BMCBI
2008
14 years 9 months ago
2008
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
94
Voted
FLAIRS
2008
14 years 12 months ago
2008
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...