Buscar
Mostrando ítems 1-10 de 12
Ponencia
Witness-Bar Visibility Graphs
(Instituto de Matemáticas de la UNAM, 2013)
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted ...
Ponencia
Parallel Homology Computation of Meshes
(Springer, 2016)
In this paper, we propose a method to compute, in parallel, the homology groups of closed meshes (i.e., orientable 2D manifolds without boundary) represented by combinatorial maps. Our experiments illustrate the interest ...
Ponencia
Studying the Chlorophyll Fluorescence in Cyanobacteria with Membrane Computing Techniques
(Fénix Editora, 2013)
In this paper, we report a pioneer study of the decrease in chlorophyll uorescence produced by the reduction of MTT (a dimethyl thiazolyl diphenyl tetrazolium salt) monitored using an epi uorescence microscope coupled ...
Ponencia
One More Step Towards Well-Composedness of Cell Complexes over nD Pictures
(Springer, 2019)
An nD pure regular cell complex K is weakly well-composed (wWC) if, for each vertex v of K, the set of n-cells incident to v is face-connected. In previous work we proved that if an nD picture I is digitally well composed ...
Ponencia
Solving SAT with Antimatter in Membrane Computing
(Fénix Editora, 2015)
The set of NP-complete problems is split into weakly and strongly NP- complete ones. The di erence consists in the in uence of the encoding scheme of the input. In the case of weakly NP-complete problems, the intractability ...
Ponencia
The chamber complex for the Littlewood-Richardson coefficients of GL4
(Universidad de Sevilla, 2020)
Ponencia
Self-constructing Recognizer P Systems
(Fénix Editora, 2014)
Usually, the changes produced in the membrane structure of a P system are considered side effects. The output of the computation is encoded as a multiset placed in a specific region and the membrane structure in the ...
Ponencia
Antimatter as a Frontier of Tractability in Membrane Computing
(Fénix Editora, 2014)
It is well known that the polynomial complexity class of recognizer polarizationless P systems with active membranes, without dissolution and with division for elementary and non-elementary membranes is exactly the ...
Ponencia
Persistent Homology Computation Using Combinatorial Map Simplification
(Springer, 2019)
We propose an algorithm for persistence homology computation of orientable 2-dimensional (2D) manifolds with or without boundary (meshes) represented by 2D combinatorial maps. Having as an input a real function h on the ...
Ponencia
Computing and reducing slope complexes
(Springer, 2019)
In this paper we provide a new characterization of cell de- composition (called slope complex) of a given 2-dimensional continuous surface. Each patch (cell) in the decomposition must satisfy that there exists a monotonic ...