Listar Ponencias (Matemática Aplicada I) por agencia financiadora "Ministerio de Educación y Ciencia (MEC). España"
Mostrando ítems 1-16 de 16
-
Artículo
A parallel Homological Spanning Forest framework for 2D topological image analysis
(Elsevier, 2016)In [14], a topologically consistent framework to support parallel topological analysis and recognition for2 D digital ...
-
Ponencia
An algorithm for computing the first homology groups of CDGAs with linear differential
(Research Institute for Symbolic Computation, 1999)We design here a primary platform for computing the basic homological information of Commutative Differential Graded ...
-
Ponencia
“Coalgebra” Structures on 1-Homological Models for Commutative Differential Graded Algebras
(Springer, 2001)In [3] “small” 1-homological model H of a commutative differential graded algebra is described. Homological Perturbation ...
-
Ponencia
Color Segmentation Of 2D Images With Thresholding
(Springer, 2012)Membrane Computing is a biologically inspired computational model. Its devices are called P systems and they perform ...
-
Ponencia
Computing Cocycles on Simplicial Complexes
(Springer, 1999)In this note, working in the context of simplicial sets [17], we give a detailed study of the complexity for computing ...
-
Ponencia
Computing the cohomology ring on simplicial complexes
(Universidad de Sevilla, Departamento de Matemática Aplicada I, 2003) -
Ponencia
Descriptional Complexity of Tissue-Like P Systems with Cell Division
(Springer, 2009)In this paper we address the problem of describing the complexity of the evolution of a tissue-like P system with cell ...
-
Ponencia
Imágenes digitales y complejos simploidales
(Universidad de Cádiz, Servicio de Publicaciones, 2007) -
Ponencia
Incremental-Decremental Technique for Delineating Tunnels and Pockets in 3D Digital Images
(WikiCFP, 2009)In this paper, we combine two complementary techniques for computing homol- ogy: Incremental Algorithm for computing ...
-
Ponencia
Measuring the error of linear separators on linearly inseparable data
(Prensas Universitarias de Zaragoza, 2009-06)Given linearly inseparable sets R of red points and B of blue points, we consider several measures of how far they are ...
-
Ponencia
Obtaining Homology Groups in Binary 2D Images Using P Systems
(IEEE Computer Society, 2009)Membrane Computing is a new paradigms inspired from cellular communication. We use in this paper the computational devices ...
-
Ponencia
On some partitioning problems for two-colored point sets
(Prensas de la Universidad de Zaragoza, 2009)Let S be a two-colored set of n points in general position in the plane. We show that S admits at least 2 n 17 ...
-
Ponencia
On the vulnerability of some families of graphs
(Iniciativa Digital Politècnica, 2010)The toughness of a noncomplete graph G is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over all ...
-
Ponencia
Periodic maximal graphs in the Lorentz-Minkowki space L3
(Real Sociedad Matemática Española, 2005) -
Ponencia
Separación y clasificación de puntos rojos y azules
(Universidad de Valladolid, 2007)En este trabajo estudiamos el problema de determinar si dos conjuntos disjuntos de n puntos en el plano son separables ...
-
Ponencia
Solving the Independent Set problem by using tissue-like P systems with cell division
(Springer, 2009)Tissue-like P systems with cell division is a computing model in the framework of Membrane Computing inspired by the ...