Envíos recientes

  • IconMethods of computational topology for Solar Activity forecasting (Extended abstract)  [Artículo]

    Knyazeva, Irina; Makarenko, Nikolay; Malkova, Daria (Universidad de Sevilla, 2015)
    Solar activity is a space-time complex of events which produced by the Sun magnetic fields. One of the results of this activity is a huge plasma ejection which called solar flares. The solar flares occurs mainly in the ...
  • IconComputing Fundamental Group via Forman’s Discrete Morse Theory Extended abstract  [Artículo]

    Brendel, Piotr; Dlotko, Pawel; Ellis, Graham; Juda, Mateusz; Mrozek, Marian (Universidad de Sevilla, 2015)
    We present research in progress on the algorithmic computation of the fundamental group of a CW complex. We use the algorithm to compute certain algebraic invariants of the fundamental group of the complement of a knot. ...
  • IconCharacterizing Configurations of critical points through LBP Extended Abstract  [Artículo]

    González Díaz, Rocío; Kropatsch, Walter G.; Cerman, Martin; Lamar León, Javier (Universidad de Sevilla, 2015)
    In this abstract we extend ideas and results submitted to [3] in which a new codification of Local Binary Patterns (LBP) is given using combinatorial maps and a method for obtaining a representative LBP image is developed ...
  • IconCAPD::RedHom - Reduction heuristics for homology algorithms  [Artículo]

    Juda, Mateusz; Mrozek, Marian (Universidad de Sevilla, 2015)
    We present an efficient software package for computing homology of sets, maps and filtrations represented as cubical, simplicial and regular CW complexes. The core homology computation is based on classical Smith ...
  • IconThe algorithm for going through a labyrinth by an autonomous  [Artículo]

    Raduca, Eugen; Adiran, Paun; Raduca, Mihaela; Draghici, Silviu; Anghel Drugarin, Co (Universidad de Sevilla, 2015)
    The paper presents an algorithm for going through a path type labyrinth by an autonomous vehicle. The detection of the path and the maintaining of the motion direction have been addressed as well as going through the ...
  • IconA Linear Time Algorithm for Drawing a Graph in 3 Pages within its Isotopy Class in 3-Space  [Artículo]

    Kurlin, Vitaliy (Universidad de Sevilla, 2015)
    We consider undirected graphs up to an ambient isotopy in 3-space. Such a graph can be represented by a plane diagram or a Gauss code. We recognize in linear time if a Gauss code represents an actual graph in 3-space. We ...