Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Johanna Björklund"'
Publikováno v:
Algorithms, Vol 17, Iss 6, p 268 (2024)
A regular unranked tree folding consists of a regular unranked tree language and a folding operation that merges (i.e., folds) selected nodes of a tree to form a graph; the combination is a formal device for representing graph languages. If, in the p
Externí odkaz:
https://doaj.org/article/38f4c5e18400400493e452dd290828bf
Publikováno v:
Computational Linguistics, Vol 48, Iss 1, Pp 119-153 (2022)
AbstractWe show that a previously proposed algorithm for the N-best trees problem can be made more efficient by changing how it arranges and explores the search space. Given an integer N and a weighted tree automaton (wta) M over the tropical semirin
Externí odkaz:
https://doaj.org/article/04be039535e94327bfda4290c825083e
Publikováno v:
International Journal of Agricultural Sustainability, Vol 15, Iss 6, Pp 693-707 (2017)
Industrial meat production has several negative environmental effects. Governments’ agricultural policies aim for cost efficiency combined with high environmental and animal welfare, which puts farmers in a difficult situation trying to navigate be
Externí odkaz:
https://doaj.org/article/7c74c259eebc4845b1d7602e662ae76d
Publikováno v:
Ecology and Society, Vol 15, Iss 3, p 29 (2010)
This article examines how local food systems in the form of farmers' markets can enhance adaptive capacity and build social-ecological resilience. It does this by exploring the learning potential among farmers and customers. Learning can enable actor
Externí odkaz:
https://doaj.org/article/d8e7f1dfb2144e38879a05a8d343a040
Publikováno v:
Læring gennem mad og måltider i grundskolen: Teori og praksis fra Danmark, Sverige og Norge ISBN: 9788202797737
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b191bb1bcff76815a1b2d54ecca6604f
https://doi.org/10.23865/noasp.182.ch00
https://doi.org/10.23865/noasp.182.ch00
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1eb775dabfd36e9257f8e0ebf9ae441
https://doi.org/10.2139/ssrn.4291269
https://doi.org/10.2139/ssrn.4291269
Publikováno v:
Journal of Computer and System Sciences. 104:119-130
We generalise a search algorithm by Mohri and Riley from strings to trees. The original algorithm takes as input a nondeterministic weighted automaton M over the tropical semiring and an integer N, ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58f318061fca99c2cf19d6998ab48c27
https://doi.org/10.1016/j.jcss.2017.03.006
https://doi.org/10.1016/j.jcss.2017.03.006
Autor:
Loek Cleophas, Johanna Björklund
Publikováno v:
Acta Informatica, 58(3), 177-194. Springer
We present a minimization algorithm for non-deterministic finite state automata that finds and merges bisimulation-equivalent states. The bisimulation relation is computed through partition aggregation, in contrast to existing algorithms that use par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8fa34ffc27a6e3804eaac3e2a873e6d7
http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-170707
http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-170707
Publikováno v:
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::affe7bc1d5c1e9fa6931292d052367b6
https://doi.org/10.18653/v1/2021.emnlp-main.719
https://doi.org/10.18653/v1/2021.emnlp-main.719
Publikováno v:
FSMNLP
We develop a finite-state transducer for translating unranked trees into general graphs. This work is motivated by recent progress in semantic parsing for natural language, where sentences are first mapped into tree-shaped syntactic representations,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83cc261bba0c6047498eb1c8d38dd8dd
http://hdl.handle.net/11577/3398880
http://hdl.handle.net/11577/3398880