umu.sePublications
Change search
Refine search result
1 - 4 of 4
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Awid, Kamil
    et al.
    Cleophas, Loek
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Watson, Bruce W.
    Using Human Computation in Dead-zone based 2D Pattern Matching2016In: Prague Stringology Conference 2016 / [ed] Holub, J Zdarek, J, CZECH TECHNICAL UNIV PRAGUE , 2016, p. 22-32Conference paper (Other academic)
    Abstract [en]

    This paper examines the application of human computation (HC) to two-dimensional image pattern matching. The two main goals of our algorithm are to use turks as the processing units to perform an efficient pattern match attempt on a subsection of an image, and to divide the work using a version of dead-zone based pattern matching. In this approach, human computation presents an alternative to machine learning by outsourcing computationally difficult work to humans, while the dead-zone search offers an efficient search paradigm open to parallelization-making the combination a powerful approach for searching for patterns in two-dimensional images.

  • 2. Belabbaci, Ahlem
    et al.
    Cherroun, Hadda
    Cleophas, Loek
    Umeå University, Faculty of Science and Technology, Department of Computing Science. FASTAR Research Group, Stellenbosch University, South Africa.
    Ziadi, Djelloul
    Tree pattern matching from regular tree expressions2018In: Kybernetika (Praha), ISSN 0023-5954, E-ISSN 1805-949X, Vol. 54, no 2, p. 221-242Article in journal (Refereed)
    Abstract [en]

    In this work we deal with tree pattern matching over ranked trees, where the pattern set to be matched against is defined by a regular tree expression. We present a new method that uses a tree automaton constructed inductively from a regular tree expression. First we construct a special tree automaton for the regular tree expression of the pattern E, which is somehow a generalization of Thompson automaton for strings. Then we run the constructed automaton on the subject tree t. The pattern matching algorithm requires an O(vertical bar t vertical bar vertical bar E vertical bar) time complexity, where vertical bar t vertical bar is the number of nodes of t and vertical bar E vertical bar is the size of the regular tree expression E. The novelty of this contribution besides the low time complexity is that the set of patterns can be infinite, since we use regular tree expressions to represent patterns.

  • 3.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cleophas, Loek
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Stellenbosch University, ZA-7602 Matieland, South Africa.
    A Taxonomy of Minimisation Algorithms for Deterministic Tree Automata2016In: Journal of universal computer science (Online), ISSN 0948-695X, E-ISSN 0948-6968, Vol. 22, no 2, p. 180-196Article in journal (Refereed)
    Abstract [en]

    We present a taxonomy of algorithms for minimising deterministic bottom-up tree automata (DTAs) over ranked and ordered trees. Automata of this type and its extensions are used in many application areas, including natural language processing (NLP) and code generation. In practice, DTAs can grow very large, but minimisation keeps things manageable. The proposed taxonomy serves as a unifying framework that makes algorithms accessible and comparable, and as a foundation for efficient implementation. Taxonomies of this type are also convenient for correctness and complexity analysis, as results can frequently be propagated through the hierarchy. The taxonomy described herein covers a broad spectrum of algorithms, ranging from novel to well-studied ones, with a focus on computational complexity.

  • 4.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cleophas, Loek
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Department of Information Science, Stellenbosch University, Stellenbosch, South Africa.
    Minimization of Finite State Automata Through Partition Aggregation2016In: Logical Aspects of Computational Linguistics: Celebrating 20 Years of LACL (1996–2016) / [ed] Amblard, M DeGroote, P Pogodalla, S Retore, C, SPRINGER-VERLAG BERLIN , 2016, p. 328-328Conference paper (Refereed)
1 - 4 of 4
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf