Databases are continuously evolving environments, where design constructs are added, removed or updated rather often. Small changes in the database configurations might impact a l...
George Papastefanatos, Fotini Anagnostou, Yannis V...
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
Programslices have potentialuses in manysoftware engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump st...
We address the problem of object recognition in computer vision. We represent each model and the scene in the form of Attributed Relational Graph. A multiple region representation...
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...