Vladímir Rodríguez-Diez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Vladímir Rodríguez-Diez has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Manuel Sabino Lazo Cortés
Graduate Division, Tecnológico Nacional de México/IT Tlalnepantla, Tlalnepantla de Baz 54070, Mexico
5 shared publications - Jesús Ariel Carrasco-Ochoa
Department of Computer Science, Instituto Nacional de Astrofísica, Óptica y Electrónica (INAOE), Puebla 72840, Mexico
4 shared publications - Jose Francisco Martinez Trinidad
Department of Computer Science, Instituto Nacional de Astrofísica, Óptica y Electrónica (INAOE), Puebla 72840, Mexico
3 shared publications Claudia Feregrino Uribe
Instituto National de Astrofisica, Optica y Electronica, Mexico
1 shared publication- Claudia Feregrino-Uribe
Instituto Nacional de Astrofísica, Óptica y Electrónica (INAOE)
1 shared publication J Ariel Carrasco-Ochoa
1 shared publication
Latest Publications
- 1 October 2020
- Published by Elsevier in Pattern Recognition Letters
- Vol. 138, 177-184
MinReduct: A new algorithm for computing the shortest reducts
- 1 October 2020
- Published by Elsevier in Pattern Recognition Letters
- Vol. 138, 177-184
MinReduct: A new algorithm for computing the shortest reducts
- 25 May 2018
- Published by Springer Nature
- p. 41-50
The Impact of Basic Matrix Dimension on the Performance of Algorithms for Computing Typical Testors
- 25 May 2018
- Published by Springer Nature
- p. 41-50
The Impact of Basic Matrix Dimension on the Performance of Algorithms for Computing Typical Testors
- 1 April 2018
- Published by Elsevier in Information Sciences
- Vol. 435, 111-123
A new algorithm for reduct computation based on gap elimination and attribute contribution
- 1 April 2018
- Published by Elsevier in Information Sciences
- Vol. 435, 111-123
A new algorithm for reduct computation based on gap elimination and attribute contribution
- 20 May 2017
- Published by Springer Nature
- p. 127-136
Fast-BR vs. Fast-CT_EXT: An Empirical Performance Study
- 20 May 2017
- Published by Springer Nature
- p. 127-136
Fast-BR vs. Fast-CT_EXT: An Empirical Performance Study
- 1 December 2015
- Published by Elsevier in Expert Systems with Applications
- Vol. 42 (24) , 9612-9619
A fast hardware software platform for computing irreducible testors
- 1 December 2015
- Published by Elsevier in Expert Systems with Applications
- Vol. 42 (24) , 9612-9619
A fast hardware software platform for computing irreducible testors
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23256532,p. 1-4
A hardware architecture for filtering irreducible testors
Feature selection in pattern recognition is a problem whose space complexity grows exponentially regarding the number of attributes in a dataset. There are several hardware implementations of algorithms for overcoming this complexity. These hardware architectures relay on a software component for filtering irreducible features subsets, which is a computationally complex task. In this paper, a new hardware module for the filtering process is presented. The main advantage of this new architecture is that no additional time is required for hardware execution whilst the software component is no longer needed. Experimental results show that the runtime magnitude order for software is the same as for hardware in some cases. The proposed architecture is algorithm independent and may lead to smaller hardware realizations than previous architectures.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23256532,p. 1-4
A hardware architecture for filtering irreducible testors
Feature selection in pattern recognition is a problem whose space complexity grows exponentially regarding the number of attributes in a dataset. There are several hardware implementations of algorithms for overcoming this complexity. These hardware architectures relay on a software component for filtering irreducible features subsets, which is a computationally complex task. In this paper, a new hardware module for the filtering process is presented. The main advantage of this new architecture is that no additional time is required for hardware execution whilst the software component is no longer needed. Experimental results show that the runtime magnitude order for software is the same as for hardware in some cases. The proposed architecture is algorithm independent and may lead to smaller hardware realizations than previous architectures.