Zobrazeno 1 - 10
of 243
pro vyhledávání: '"tree matching"'
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.
Publikováno v:
IEEE Access, Vol 7, Pp 162756-162767 (2019)
Code reuse has been perceived to be an effective tool for user interface development that is known to be complex and messy. A fundamental problem in user interface code reuse is how to effectively retrieve working code from existing code repositories
Externí odkaz:
https://doaj.org/article/a2ac9dabf4374a4d87fffa93317ecb0e
Autor:
William R. Taylor
Publikováno v:
Algorithms for Molecular Biology, Vol 12, Iss 1, Pp 1-22 (2017)
Abstract Background In order to find correlated pairs of positions between proteins, which are useful in predicting interactions, it is necessary to concatenate two large multiple sequence alignments such that the sequences that are joined together b
Externí odkaz:
https://doaj.org/article/95664ca96542464b885ebda091b5ea38
Publikováno v:
Information Systems
Information Systems, 2023, ⟨10.1016/j.is.2022.102126⟩
Information Systems, 2023, ⟨10.1016/j.is.2022.102126⟩
International audience; Tree matching techniques have been investigated in many fields, including web data mining and extraction, as a key component to analyze the content of web pages. However, when applied to existing web pages, traditional tree ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6c3ee48d9586b9c7d63b12f32ea45e9
https://hal.science/hal-03774245
https://hal.science/hal-03774245
Publikováno v:
Cybernetics and Information Technologies, Vol 15, Iss 1, Pp 14-23 (2015)
An efficient scheme of component retrieval can significantly reduce the cost of software reuse. For this purpose, a method of successfully retrieving of specified components from the component repository is a crucial consideration. However, neither t
Externí odkaz:
https://doaj.org/article/29b9d1aa60fe4481afa569478e2f0199
Autor:
Brisset, Sacha
Publikováno v:
Computational Engineering, Finance, and Science [cs.CE]. Université de lille; inria lille, 2022. English. ⟨NNT : ⟩
Web. Université de Lille, 2022. English. ⟨NNT : 2022ULILB036⟩
Web. Université de Lille, 2022. English. ⟨NNT : 2022ULILB036⟩
Web applications are at every corner of modern society.The largest web applications can serve millions of people.These applications are expected to be strongly reliable and stable yet capable to evolve to adapt to its users.At such a scale, these exp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2d609947da0248db0d09ea670d2c5b93
https://theses.hal.science/tel-03887742/document
https://theses.hal.science/tel-03887742/document
Autor:
Brisset, S. (Sacha)
Les applications Web sont omniprésentes dans la société moderne.Certaines applications Web peuvent servir des millions de personnes.Ces applications se doivent d'etre fiables et stables tout en étant capables d'évoluer pour s'adapter à ses util
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______4198::e95f9bf88920b5c30b43cc4e059bb9bb
http://hdl.handle.net/20.500.12210/80056
http://hdl.handle.net/20.500.12210/80056
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.
Publikováno v:
Remote Sensing, Vol 9, Iss 5, p 505 (2017)
Determining the exact position of a forest inventory plot—and hence the position of the sampled trees—is often hampered by a poor Global Navigation Satellite System (GNSS) signal quality beneath the forest canopy. Inaccurate geo-references hamper
Externí odkaz:
https://doaj.org/article/b748773374244eaf8e4d1840e674327e
Autor:
Kim, Sung-Hwan, Cho, Hwan-Gue
Cartesian tree matching is a recently introduced string matching problem in which two strings match if their corresponding Cartesian trees are the same. It is considered appropriate to find patterns regarding their shapes especially in numerical time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9ffeddd8c65a3f9f121f974d5c9f441