Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
A type inclusion test is a procedure to decide whether two types are related by a given subtyping relationship. An efficient implementation of the type inclusion test plays an impo...
We present a technique designed aiming to improve the compression of the Edgebreaker CLERS string for large and regular meshes, where regularity is understood as the compactness o...
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 γ...
Generative representations allow the reuse of code and thus facilitate the evolution of repeated phenotypic themes or modules. It has been shown that generative representations pe...