Buscar
Mostrando ítems 1-9 de 9
Ponencia
Cuentos y cuentas para despertar la curiosidad
(THALES: Sociedad Andaluza de Educación Matemática, 2014)
Pese a la revolución científica y tecnológica de finales de siglo XX y comienzos del XXI, la enseñanza de las matemáticas a todos los niveles pero, especialmente, en educación primaria y secundaria, sigue, en la mayoría ...
Ponencia
On (−1, 1)-Matrices of Skew Type with the Maximal Determinant and Tournaments
(Springer, 2014)
Skew Hadamard matrices of order n give the solution to the question of finding the largest possible n by n determinant with entries ± 1 of skew type when n≡0(mod4) . Characterizations of skew Hadamard matrices in terms ...
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
Topo-Geometric Filtration Scheme for Geometric Active Contours and Level Sets: Application to Cerebrovascular Segmentation
(Springer, 2014)
One of the main problems of the existing methods for the segmentation of cerebral vasculature is the appearance in the segmentation result of wrong topological artefacts such as the kissing vessels. In this paper, a new ...
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 groups in order to understand the original discrete object. The classic approach consists in ...
Ponencia
Extraction d’information homologique des objets discrets s’appuyant sur des graphes orientés
(CRESTIC - Centre de Recherche en Sciences et Technologies de l'Information et de la Communication, 2014)
Tout objet discret n-dimensionnel peut être transformé en complexe cubique, dont on peut étudier les groupes d’homologie pour mieux comprendre l’objet original. Une approche classique consiste à calculer la Forme Normale ...
Otros
Ponencia
Breaking symmetries of graphs with resolving sets
(2014)
We undertake a study on the maximum value of the difference between the metric dimension and the determining number of a graph as a function of its order. Our results include lower and upper bounds on that maximum, and ...