Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
We report on the implementation and experimental analysis of an incremental multi-pass tableau-based procedure `a la Wolper for testing satisfiability in the linear time temporal ...
When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets d...
Abstract. Design patterns already proved successful in lowering the development time and number of errors of object-oriented software; now, they are, candidate to play a similar ro...
Massimo Cossentino, Luca Sabatucci, Antonio Chella
Abstract. Modern software engineering attacks its complexity problems by applying well-understood development principles. In particular, the systematic adoption of design patterns ...
Hans-Werner Sehring, Sebastian Bossung, Patrick Hu...