Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...
Bertrand Anckaert, Matias Madou, Bjorn De Sutter, ...
The main difficulty in the binary object classification field lays in dealing with a high variability of symbol appearance. Rotation, partial occlusions, elastic deformations, or...
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
Compression of term frequency lists and very long document-id lists within an inverted file search engine are examined. Several compression schemes are compared including Elias γ...
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...