Data mining is at the core of the knowledge discovery process. However, an initial preprocessing step is crucial for assuring reliable results within this process. Preprocessing of data is a time-consuming and non-trivial task since data quality issues should be…

El presente artículo describe un sistema de adquisición de datos para un medidor de deformación. Se presenta el análisis del diseño de la circuitería y la programación, los resultados obtenidos y finalmente algunas conclusiones.

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…

As a part of a taxonomic revision of Ethesia Raf., a new species, E. tanquana Mart.-Azorín & M.B.Crespo, is described from the Tanqua Karoo in South Africa. This new species is at first sight similar to E. haalenbergensis (U.Müll.-Doblies &…

AbstractDue to aspect-oriented mechanisms explosion, their concepts arrive to distributed systems tackling concepts as security, persistence, or synchronization, especially in middleware approaches. Regarding distributed databases, the research has been focused mainly on object-oriented databases. Based on the great impact of…

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

This paper is an attempt to define how a
specific data structure might be used to
store, in a persistent manner, temporal
information during a computer simulation.
In particular, it considers the sort of
temporal information generated during a
discrete…

Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, called Sparse Spatial Selection (SSS).
The main characteristic of this method is that it…

The metric spaces model formalizes the similarity search concept in nontraditional databases. The goal is to build an index designed to save distance computations when answering similarity queries later. A large class of algorithms to build the index are based…

The k nearest neighbor (k-NN) classifier has been extensively used in Pattern Recognition because of its simplicity and its good performance. However, in large datasets applications, the exhaustive k-NN classifier becomes impractical. Therefore, many fast k-NN classifiers have been developed;…