Listar Matemática Aplicada I por título
Mostrando ítems 255-274 de 1037
-
Artículo
Computational Topology in Image Context
(Elsevier, 2012) -
Tesis Doctoral
Computational topology on neural networks: from the data to the model
(2021)Machine learning is drawn from a dataset that needs to be explained. Following this aim, a model is described to make ...
-
Artículo
Computer Analysis of Images and Patterns
(Springer, 2013) -
Artículo
Computing Adem Cohomology Operations
(Cornell University, 2006)We deal with the problem of obtaining explicit simplicial formu- lae defining the classical Adem cohomology operations ...
-
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 ...
-
Artículo
Computing autotopism groups of partial Latin rectangles: A pilot study
(Wiley, 2019)Computing the autotopism group of a partial Latin rectangle can be performed in a variety of ways. This pilot study has ...
-
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 ...
-
Artículo
Computing cup products in \(\mathbb {Z}_2\)-cohomology of 3D polyhedral complexes
(2014)Let \(I=(\mathbb {Z}^3,26,6,B)\) be a three-dimensional (3D) digital image, let \(Q(I)\) be an associated cubical complex, ...
-
Ponencia
Computing Homological Information Based on Directed Graphs within Discrete Objects
(IEEE Computer Society, 2014)n-dimensional discrete objects can be interpreted as cubical complexes which are suitable for the study of their homology ...
-
Ponencia
Computing Optimal Shortcuts for Networks
(Dagsthul Publishing, 2018)We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between ...
-
Artículo
Computing optimal shortcuts for networks
(ELSEVIER SCIENCE BV; ELSEVIER, 2019)We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between ...
-
Ponencia
Computing the cohomology ring on simplicial complexes
(Universidad de Sevilla, Departamento de Matemática Aplicada I, 2003) -
Ponencia
Computing the Component-Labeling and the Adjacency Tree of a Binary Digital Image in Near Logarithmic-Time
(Springer, 2019)Connected component labeling (CCL) of binary images is one of the fundamental operations in real time applications. The ...
-
Ponencia
Computing the sets of totally symmetric and totally conjugate orthogonal partial Latin squares by means of a SAT solver
(Computational and Mathematical Methods in Science and Engineering, 2017-07)Conjugacy and orthogonality of Latin squares have been widely studied in the literature not only for their theoretical ...
-
Artículo
Computing the Tutte polynomial of Archimedean tilings
(2014)We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, ...
-
Ponencia
Computing “Small” 1–Homological Models for Commutative Differential Graded Algebras
(Springer, 2000)We use homological perturbation machinery specific for the algebra category [13] to give an algorithm for computing the ...
- Artículo
-
Ponencia
Conceptos básicos sobre isocriptografía siguiendo el modelo MCIM
(Universidad Politécnica de Madrid, 2004)Una de las aplicaciones prácticas de la isoteoría de Santilli que ha surgido en los últimos años se refiere al campo de ...
- Ponencia
-
Ponencia
Conexiones ortogonales con vértices prefijados
(Alberto Márquez, 2002)