Zobrazeno 1 - 10
of 97
pro vyhledávání: '"C. de la Higuera"'
Publikováno v:
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
Universidad de Alicante (UA)
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition, or in fields to which pattern recognition is linked: computational linguistics, machine learning, time series analysis, circuit testing, computational bi
Publikováno v:
Theoretical Computer Science. 230:39-48
Given a set of strings, the problem of finding a string that minimises its distance to the set is directly related with problems frequently encountered in areas involving Pattern recognition or computational biology. Based on the Levenshtein (or edit
Publikováno v:
Pattern Recognition Letters. 20:813-821
The general problem of decoding an acoustic sequence into an optimal word string under the probabilistic framework cannot be solved by an algorithm in polynomial time. This result is achieved by using the Computational Complexity Theory. The main con
Autor:
A. von Arnim, C. de la Higuera
Publikováno v:
Discrete Applied Mathematics. 51:219-232
Semi-orders form a subclass of interval orders: they can be represented as sets of intervals of a given length. We first prove that semi-orders can be partitioned by serialization (or series decomposition) without loss of the jump number aspect. On n
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
C. de la Higuera, Luisa Micó
Publikováno v:
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
ICDE Workshops
Proceedings of SISAP
Proceedings of SISAP, 2008, Cancun, Mexico
Universidad de Alicante (UA)
ICDE Workshops
Proceedings of SISAP
Proceedings of SISAP, 2008, Cancun, Mexico
In order to better fit a variety of pattern recognition problems over strings, using a normalised version of the edit or Levenshtein distance is considered to be an appropriate approach. The goal of normalisation is to take into account the lengths o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e1f5639a34e5a1563dda00572f2d3b1
http://hdl.handle.net/10045/8774
http://hdl.handle.net/10045/8774
Publikováno v:
IEEE transactions on pattern analysis and machine intelligence. 27(7)
Probabilistic finite-state machines are used today in a variety of areas in pattern recognition or in fields to which pattern recognition is linked. In Part I of this paper, we surveyed these objects and studied their properties. In this Part II, we
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Machine Learning: ECML-94 ISBN: 9783540578680
ECML
ECML
In this paper, we propose an example representation system that combines a greater expressive richness than that of the Boolean framework and an analogous treatment complexity. The model we have chosen is algebraic, and has been used up to now to cop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::14adc961e3456ad6d43371e40b64971b
https://doi.org/10.1007/3-540-57868-4_75
https://doi.org/10.1007/3-540-57868-4_75
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.