This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...
Radoslaw Szymanek, Francky Catthoor, Krzysztof Kuc...
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...