Hiram Calvo

The Mexican Magical Towns Traveling Salesman Problem: Preliminary Results

2017 · Research in Computing Science

The Traveling Salesman Problem (TSP) is a classical NPhard combinatorial problem that has been intensively studied through several decades. A large amount of literature is dedicated to this problem. TSP can be directly applied to …

Toward Universal Word Sense Disambiguation Using Deep Neural Networks

2019 · IEEE Access

Traditionally, approaches based on neural networks to solve the problem of disambiguation of the meaning of words (WSD) use a set of classifiers at the end, which results in a specialization in a single set …

Search of Highly Selective Cells in Convolutional Layers with Hebbian Learning

2023

Deep Convolutional Neural Networks (ConvNets) have demonstrated successful implementations in various vision tasks, including image classification, segmentation, and image captioning. Despite their achievements, concerns persist regarding the explainability of these models, often referred to as …