Publications (5)3.41 Total impact

[Show abstract][Hide abstract]ABSTRACT:
B-trees are suitable data structures for index terms in a database or in an information retrieval system. B∗-trees optimize the characteristics of B-trees. In this paper we present an algorithm for optimization of the pagination of a B∗-tree with variable-length keyed records. We also present some results obtained in the application of this algorithm, compared with the application of a B-tree with variable-length keys.

[Show abstract][Hide abstract]ABSTRACT:
This paper describes the architecture and the main features of DOMINO, a multimedia information retrieval system whose database is a collection of multimedia documents (MDs) con stituted of a mixing of texts and images. DOMINO data structure has been designed in such a way that both MD integrity and query symmetry with respect to the type of information involved (textual or pictorial) are preserved.

[Show abstract][Hide abstract]ABSTRACT:
In a diagrammatic conversion iconic, verbal and graphic messages
are spontaneously exchanged. If a computing system is to be used in the
communication, it must be able to understand the conversants' lexicon
and language. The paper discusses the design of such a system. The
system understands the visual messages exploiting existing image
interpretation tools and different knowledge basis defined according to
the different specific context in which the conversation takes place

[Show abstract][Hide abstract]ABSTRACT:
A method is presented for the definition and description of structures, that is, sets of visible elements in a binary digital image. The method is designed so as to facilitate the extraction, analysis, and manipulation of structures and is based on a numerical code which synthesizes the description of an element in its 8-neighborhood. Taxonomies of features and structures are derived and discussed. The exploitation of APL typical “many-words-at-a-time” computing notation allows us to show how every defined structure may be derived and described by the use of simple techniques of parallel selection and sorting. The same techniques are used in the definition of a parallel algorithm which identifies the descriptions of the connected components and assigns them intrinsic labels by establishing relations of surroundedness. The inverse parallel algorithm, which displays the binary image corresponding to a given description, is thereafter described. The method has been tested in different practical experiments. Hints are then given on strategies which were originated using the method in practical experiments.