Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
In image retrieval, global features related to color or texture are commonly used to describe the image. The use of interest points in contentbased image retrieval allows image ind...
Rules have been proposed for providing active behaviour in DBMS. Previous attempts to add rules to Object Oriented DBs have often resulted in a dichotomy between rules and other k...
Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architectur...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...