Listar Matemática Aplicada I por título
Mostrando ítems 852-871 de 1040
-
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
Separating Topological Noise from Features Using Persistent Entropy
(Springer, 2016)Topology is the branch of mathematics that studies shapes and maps among them. From the algebraic definition of topology ...
-
Artículo
Sequential density techniques for an approximate Radon-Nikodym theorem
(Springer, 2007)We deal with the problem of approximate representation of linear functionals and show how the sequential density techniques may be used for solution.
-
Artículo
Set-independence graphs of vector spaces and partial quasigroups
(Yildiz Technical University, 2023-09-04)As a generalization of independence graphs of vector spaces and groups, we introduce the notions of set-independence graphs ...
-
Artículo
Seudosuperficies y economía
(2000) -
Artículo
Sex Differences in the Gut Microbiota as Potential Determinants of Gender Predisposition to Disease
(Wiley, 2019)Scope: Dysbiosis of gut microbiota is involved in metabolic syndrome (MetS) development, which has a different incidence ...
-
Artículo
Sex-specific differences in intestinal microbiota associated with cardiovascular diseases
(BMC, 2024-01-19)Background Cardiovascular diseases (CVD), including coronary heart disease (CHD), display a higher prevalence in men than ...
-
Ponencia
Shortcut sets for Euclidean graphs
(2015-07)A Euclidean graph G is the locus of a rectilinear embedding of a planar graph in the Euclidean plane. A shortcut set S is ...
-
Artículo
Shortcut sets for plane Euclidean networks (Extended abstract)
(Elsevier, 2016)We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of ...
-
Artículo
Shortcut sets for the locus of plane Euclidean networks
(Elsevier, 2018)We study the problem of augmenting the locus N of a plane Euclidean network N by in- serting iteratively a finite set ...
- Ponencia
-
Capítulo de Libro
Simplicial perturbation techniques and effective homology
(2006)In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an “elementary ...
-
Artículo
Simplicial-Map Neural Networks Robust to Adversarial Examples
(MDPI [Commercial Publisher], 2021-01-15)Broadly speaking, an adversarial example against a classification model occurs when a small perturbation on an input data ...
-
Artículo
Simplification techniques for maps in simplicial topology
(2005)This paper offers an algorithmic solution to the problem of obtaining “economical” formulae for some maps in Simplicial ...
-
Artículo
Single bend wiring on surfaces
(2002)The following problem of rectilinear routing is studied: given pairs of points on a surface and a set of permissible ...
- Tesis Doctoral
-
Artículo
Size of graphs with high girth
(Elsevier, 2007)Let n≥4 be a positive integer and let ex (ν;{C3, . . . , Cn}) denote the maximum number of edges in a {C3, . . . , Cn}-free ...
-
Ponencia
Skeletonizing Images by Using Spiking Neural P Systems
(Fénix Editora, 2012)Skeletonizing an image is representing a shape with a small amount of information by converting the initial image into a ...
-
Ponencia
Smoothing Problem in 2D Images with Tissue-like P Systems and Parallel Implementation
(Fénix Editora, 2011)Smoothing is often used in Digital Imagery to reduce noise within an image. In this paper we present a Membrane Computing ...
-
Ponencia
Snell’s law in an isoperimetric setting
(American Institute of Physics, 2010)In this work we focus on the isoperimetric problem in R2 endowed with a piecewise constant density. We will see that the ...