Efficient data representation in polymorphic languages
Texte intégral
Documents relatifs
For the Czech language a comparison of a light and a more aggressive stemmer to remove both inflectional and some derivational suffixes, reveals only small performance differences..
In Section 2 we present a run- ning example that involves querying a real-world large relational dataset and extracting an EMF model from it using an OCL-based imperative
Moving from the principles of the measures based on concept extension and Information Content, we propose a similarity measure exploiting the notion of concept extension, but instead
Listing 1.9. For instance, a basic visual 10-digit calculator and a scientific plotter may share on a common arithmetic library. Both evaluators use division and may suffer
The function solve takes the result of construct and solves the constraints of the class by the type unification algorithm from [Plü09], such that the constraints contains only
As in this data cube representation (subsection II-E), each cuboid over a
A generic and generative approach to automatically derive domain-specific trace constructors: The gener- ated constructors can be embedded in a model execution environment for
On the other hand, the emergence of Big Data some years ago denoted the challenge of dealing with huge collections of heterogeneous data continuously produced and to be