Listar Capítulos (Matemática Aplicada I) por título
Mostrando ítems 31-50 de 68
-
Capítulo de Libro
Homological computation using spanning trees
(2009)We introduce here a new F2 homology computation algorithm based on a generalization of the spanning tree technique on a ...
-
Capítulo de Libro
Homological tree-based strategies for image analysis
(2009)Homological characteristics of digital objects can be obtained in a straightforward manner computing an algebraic map φ ...
-
Capítulo de Libro
Human gait identification using persistent homology
(2012)This paper shows an image/video application using topological invariants for human gait recognition. Using a background ...
-
Capítulo de Libro
Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology
(2011)In this paper, we establish a correspondence between the incremental algorithm for computing AT-models [8,9] and the one ...
-
Capítulo de Libro
Integral operators for computing homology generators at any dimension
(2008)Starting from an nD geometrical object, a cellular subdivision of such an object provides an algebraic counterpart from ...
-
Artículo
Irregular graph pyramids and representative cocycles of cohomology generators
(2009)Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological ...
-
Capítulo de Libro
Labeling Subway Lines
(2001)Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to ...
-
Capítulo de Libro
LBP and irregular graph pyramids
(2015)In this paper, a new codification of Local Binary Patterns (LBP) is given using graph pyramids. The LBP code characterizes ...
-
Capítulo de Libro
Modelling of bedload sediment transport for weak and strong regimes
(Springer, 2021)A two-layer shallow water type model is proposed to describe bedload sediment transport for strong and weak interactions ...
-
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 ...
-
Capítulo de Libro
On irreductible triangulations of Punctured Torus and Punctured Klein Bottle
(Editorial UCA, 2007)We extend Lawrencenko and Negami’s results in [4, 5] by establishing lower and upper bounds for the number of irreducible triangulations of the punctured torus and the punctured Klein bottle.
-
Capítulo de Libro
On the Computation of Ainfinity-Maps
(2007)Starting from a chain contraction (a special chain homotopy equivalence) connecting a differential graded algebra A with ...
-
Capítulo de Libro
Periodos asociados a los isotopismos de un cuadrado latino
(Instituto Superior de Engenharia da Universidade do Algarve, 2009)En Criptografía, la eficacia de un generador de secuencias pseudo-aleatorias viene determinada por el periodo de crecimiento ...
-
Capítulo de Libro
Persistent Homology for 3D Reconstruction Evaluation
(2012)Space or voxel carving is a non-invasive technique that is used to produce a 3D volume and can be used in particular for ...
-
Capítulo de Libro
Polynomials and graph homomorphisms
(Chapman and Hall/CRC, 2022)We develop in the language of graph homomorphisms the connection between the Tutte polynomial and the state models of ...
-
Capítulo de Libro
Rearrangement invariant optimal domain for monotone kernel operators
(Springer, 2009)For a kernel operator T with values in a Banach function space X, we give monotonicity conditions on the kernel which ...
-
Capítulo de Libro
Reducing Computational Costs in the Basic Perturbation Lemma
(2006)Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, ...
-
Capítulo de Libro
Removal operations in nD generalized maps for efficient homology computation
(2012)In this paper, we present an efficient way for computing homology generators of nD generalized maps. The algorithm proceeds ...
-
Capítulo de Libro
Rescheduling Railway Timetables in Presence of Passenger Transfers Between Lines Within a Transportation Network
(Springer, 2014)The problem of coordinating transfers consists of determining timetables which ensure the transfer of passengers between ...
-
Capítulo de Libro
Reusing integer homology information of binary digital images
(2006)In this paper, algorithms for computing integer (co)homology of a simplicial complex of any dimension are designed, extending ...