Search academic resources

At any time humans need accurate information to solve different problems. For example, how to perform a task, what happens in the news, what the hundreds of tweets say, etc. On the other hand, electronic information has ...

El objetivo principal de esta tesis es estudiar la teoría de prueba de la Programación en Lógica Rebatible (P.L.R.) y brindar una caracterización declarativa equivalente. La P.L.R. es una herramienta valiosa para la ...

Due to the simplicity of their implementations, least square support vector machine (LS-SVM) and proximal support vector machine (PSVM) have been widely used in binary classification applications. The conventional LS-SVM...

We introduce and discuss a new computational model for the HermiteLagrange interpolation with nonlinear classes of polynomial interpolants. We distinguish between an interpolation problem and an algorithm that solves it....

Advances in next generation technologies have driven the costs of DNA sequencing down to the point that genotyping-by-sequencing (GBS) is now feasible for high diversity, large genome species. Here, we report a procedure...

Nowadays, the scientific applications are developed with more complexity and accuracy and these precisions need high computational resources to be executed. Also, the current trend in high performance computing (HPC) is ...

The problem of fi nding a minimum area polygonization for a given set of points in the plane, Minimum Area Polygonization (MAP) is NP-hard. Due to the complexity of the problem we aim at the development of algorithms to ...

It is known that the Minimum Weight Triangulation problem is NP-hard. Also the complexity of Minimum Weight Pseudo-Triangulation problem is unknown, suspecting that it is also a NP-hard problem. Therefore we focused on ...

The hallmarks of cancer comprise six biological capabilities acquired during the multistep development of human tumors. The hallmarks constitute an organizing principle for rationalizing the complexities of neoplastic di...