The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
We propose a new approach to accelerate transaction level verification by raising the productivity of the verification suites including test patterns, protocol checker, and simula...
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...
Koenraad De Bosschere, Saumya K. Debray, David Gud...
In this paper, the results of a semi-supervised approach based on the Expectation-Maximisation algorithm for model-based clustering are presented. We show in this work that, if th...
Adolfo Martínez-Usó, F. Pla, Jose Martínez Soto...
This paper presents a method of classifying human gait in an invariant manner based on silhouette comparison. A database of artificially generated silhouettes is created represent...