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...
In several applications, data objects are assumed to move on predefined spatial networks such as road segments, railways, invisible air routes. Moving objects may exhibit similar...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...
Vasileios K. Pothos, Christos Theoharatos, George ...
Many bioinformatics applications would benefit from comparing proteins based on their biological role rather than their sequence. In most biological databases, proteins are alrea...
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...