Inmaculada Ventura
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
Inmaculada Ventura has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Jose Miguel Diaz-Bañez
Department of Applied Mathematics University of Seville SPAIN
27 shared publications - Carlos Seara
Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain
8 shared publications - Pablo Pérez-Lantero
Escuela de Ingeniería Civil en Informática, Universidad de Valparaíso, Valparaíso, Chile
5 shared publications - Pablo Pérez-Lantero
Facultad de Ciencia, Departamento de Matemática y Ciencia de la Computación, Universidad de Santiago de Chile (USACH), Santiago, Chile
4 shared publications - Sergey Bereg
Department of Computer Science, University of Texas at Dallas, P.O. Box 830688, Richardson, TX 75083, USA
4 shared publications P. Pérez-Lantero
3 shared publications
Latest Publications
- Open Access
- 14 June 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 331
MASPA: An efficient strategy for path planning with a tethered marsupial robotics system
- 14 June 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 331
Open AccessMASPA: An efficient strategy for path planning with a tethered marsupial robotics system
- 1 January 2025
- Published by Editorial Universidad de Sevilla
Investigación y creatividad estética del Flamenco: nuevas perspectivas de estudio
La aproximación seria y rigurosa a una cultura musical concreta, así como la comparación con otras tradiciones de raigambre oral, favorece el conocimiento de los elementos más significativos y originales de la identidad del pueblo en el que se desarrolla. En este sentido, el arte flamenco, que constituye en la actualidad una de las principales industrias culturales de la comunidad autónoma andaluza, trasciende su atractivo turístico para constituirse en objeto de estudio disciplinario. Este volumen, estructurado en cuatro secciones temáticas (I. Voz, psicoacústica y tecnología musical; II. Comparatismo musical: procesos de composición y creatividad estética; III. Etnomusicología, performatividad y estudios culturales; IV. Literatura, música e imagen: intersección de códigos), está constituido por diecisiete capítulos que analizan este patrimonio cultural desde múltiples perspectivas que ponen al servicio de la investigación del arte flamenco sus herramientas de análisis.
- 1 January 2025
- Published by Editorial Universidad de Sevilla
Investigación y creatividad estética del Flamenco: nuevas perspectivas de estudio
La aproximación seria y rigurosa a una cultura musical concreta, así como la comparación con otras tradiciones de raigambre oral, favorece el conocimiento de los elementos más significativos y originales de la identidad del pueblo en el que se desarrolla. En este sentido, el arte flamenco, que constituye en la actualidad una de las principales industrias culturales de la comunidad autónoma andaluza, trasciende su atractivo turístico para constituirse en objeto de estudio disciplinario. Este volumen, estructurado en cuatro secciones temáticas (I. Voz, psicoacústica y tecnología musical; II. Comparatismo musical: procesos de composición y creatividad estética; III. Etnomusicología, performatividad y estudios culturales; IV. Literatura, música e imagen: intersección de códigos), está constituido por diecisiete capítulos que analizan este patrimonio cultural desde múltiples perspectivas que ponen al servicio de la investigación del arte flamenco sus herramientas de análisis.
- Open Access
- 26 January 2024
- Published by Springer Nature in Optimization Letters
- Vol. 18 (8) , 1837-1854
Constrained many-to-many point matching in two dimensions
In the minimum-weight many-to-many point matching problem, we are given a set R of red points and a set B of blue points in the plane, of total size N, and we want to pair up each point in R to one or more points in B and vice versa so that the sum of distances between the paired points is minimized. This problem can be solved in $$O(N^3)$$ time by using a reduction to the minimum-weight perfect matching problem, and thus, it is not fast enough to be used for on-line systems where a large number of tunes need to be compared. Motivated by similarity problems in music theory, in this paper we study several constrained minimum-weight many-to-many point matching problems in which the allowed pairings are given by geometric restrictions, i.e., a bichromatic pair can be matched if and only if the corresponding points satisfy a specific condition of closeness. We provide algorithms to solve these constrained versions in O(N) time when the sets R and B are given ordered by abscissa.- 26 January 2024
- Published by Springer Nature in Optimization Letters
- Vol. 18 (8) , 1837-1854
Open AccessConstrained many-to-many point matching in two dimensions
In the minimum-weight many-to-many point matching problem, we are given a set R of red points and a set B of blue points in the plane, of total size N, and we want to pair up each point in R to one or more points in B and vice versa so that the sum of distances between the paired points is minimized. This problem can be solved in $$O(N^3)$$ time by using a reduction to the minimum-weight perfect matching problem, and thus, it is not fast enough to be used for on-line systems where a large number of tunes need to be compared. Motivated by similarity problems in music theory, in this paper we study several constrained minimum-weight many-to-many point matching problems in which the allowed pairings are given by geometric restrictions, i.e., a bichromatic pair can be matched if and only if the corresponding points satisfy a specific condition of closeness. We provide algorithms to solve these constrained versions in O(N) time when the sets R and B are given ordered by abscissa. - 7 April 2022
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 426
Scaling and compressing melodies using geometric similarity measures
- 7 April 2022
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 426
Scaling and compressing melodies using geometric similarity measures
- Open Access
- 28 October 2021
- Published by Springer Nature in Algorithmica
- Vol. 83 (12) , 3741-3765
Maximum Box Problem on Stochastic Points
Given a finite set of weighted points in $${\mathbb {R}}^d$$ (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is maximized. We consider that each point of the input has a probability of being present in the final random point set, and these events are mutually independent; then, the total weight of a maximum box is a random variable. We aim to compute both the probability that this variable is at least a given parameter, and its expectation. We show that even in $$d=1$$ these computations are #P-hard, and give pseudo-polynomial time algorithms in the case where the weights are integers in a bounded interval. For $$d=2$$ , we consider that each point is colored red or blue, where red points have weight $$+1$$ and blue points weight $$-\infty $$ . The random variable is the maximum number of red points that can be covered with a box not containing any blue point. We prove that the above two computations are also #P-hard, and give a polynomial-time algorithm for computing the probability that there is a box containing exactly two red points, no blue point, and a given point of the plane.- 28 October 2021
- Published by Springer Nature in Algorithmica
- Vol. 83 (12) , 3741-3765
Open AccessMaximum Box Problem on Stochastic Points
Given a finite set of weighted points in $${\mathbb {R}}^d$$ (where there can be negative weights), the maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum of the weights of the points that it contains is maximized. We consider that each point of the input has a probability of being present in the final random point set, and these events are mutually independent; then, the total weight of a maximum box is a random variable. We aim to compute both the probability that this variable is at least a given parameter, and its expectation. We show that even in $$d=1$$ these computations are #P-hard, and give pseudo-polynomial time algorithms in the case where the weights are integers in a bounded interval. For $$d=2$$ , we consider that each point is colored red or blue, where red points have weight $$+1$$ and blue points weight $$-\infty $$ . The random variable is the maximum number of red points that can be covered with a box not containing any blue point. We prove that the above two computations are also #P-hard, and give a polynomial-time algorithm for computing the probability that there is a box containing exactly two red points, no blue point, and a given point of the plane. - 26 October 2018
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 344-345, 219-229
Computing melodic templates in oral music traditions
- 26 October 2018
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 344-345, 219-229
Computing melodic templates in oral music traditions
- 13 March 2018
- Published by Springer Nature
- p. 231-244
Maximum Box Problem on Stochastic Points
- 1 July 2017
- Published by Elsevier in Information Processing Letters
- Vol. 123, 1-7
New results on the coarseness of bicolored point sets
- 1 July 2017
- Published by Elsevier in Information Processing Letters
- Vol. 123, 1-7
New results on the coarseness of bicolored point sets
- 1 January 2016
- Published by Elsevier in Computational Geometry
- Vol. 51, 55-66
Convex blocking and partial orders on the plane
- 1 January 2016
- Published by Elsevier in Computational Geometry
- Vol. 51, 55-66
Convex blocking and partial orders on the plane
- 1 March 2015
- Published by Elsevier in Computational Geometry
- Vol. 48 (3) , 169-179
On balanced 4-holes in bichromatic point sets
- 1 March 2015
- Published by Elsevier in Computational Geometry
- Vol. 48 (3) , 169-179
On balanced 4-holes in bichromatic point sets