La creciente cantidad de imágenes transmitidas a través de Internet ha llevado al desarrollo de Sistemas de Minería de Imágenes de propósito general.
La performance de un SMI depende en gran medida de una rápida y buena especificación del vector…

This paper presents a data structure based on Sparse Spatial Selection (SSS) for similarity searching. An algorithm that tries periodically to adjust pivots to the use of database index is presented. This index is dynamic. In this way, it is…

Este artículo reporta el trabajo de investigación realizado en base a datos extraídos de la Encuesta Anual realizada por la CESSI durante el año 2007 entre organizaciones dedicadas al desarrollo de Software en Argentina. Si bien la temática de mejora…

The Semantic Web attempts to reach a state in the future where everything on the Web will no longer be only machine-readable, but also machine-understandable. An ontology is an explicit specification of a conceptualization. A conceptualization is an abstract, simplified…

Metric-temporal databases are a new database model that combines metric spaces with temporal databases to process similarity queries within a time interval or snapshot. The Historical FHQT is a metric-temporal index which has shown to be competitive answering this type…

A data warehouse efficiently processes a given set of queries by utilizing the multiple materialized views. Owing to the constraint on space and maintenance cost, the materialization of all views is unfeasible. One of the critical decisions involved in the…

The genetic algorithms have seen applied in knowledge discovery and specially for discovering association rules. In this paper, we explore the use of di erent rule quality measures in the tness function in a genetic algorithm for discovering association rules.…

Manipulating and retrieving multimedia data has received increasing attention with the advent of cloud storage facilities. The ability of querying by similarity over large data collections is mandatory to improve storage and user interfaces. But, all of them are expensive…

Clustering of short texts is an important research area because of its applicability in information retrieval and text mining. To this end was proposed CLUDIPSO, a discrete Particle Swarm Optimization algorithm to cluster short texts. Initial results showed that CLUDIPSO…

Vertical partitioning, in which attributes of a relation are
assigned to partitions, is aimed at improving database
performance. We extend previous research that is based on
a single relation to multi-relation database environment,
by including referential integrity constraints, access time