[{"user_id":"117512","volume":41,"page":"1-19","_id":"60372","publisher":"Association for Computing Machinery (ACM)","status":"public","citation":{"bibtex":"@article{Brückler_Bommes_Campen_2022, title={Volume parametrization quantization for hexahedral meshing}, volume={41}, DOI={<a href=\"https://doi.org/10.1145/3528223.3530123\">10.1145/3528223.3530123</a>}, number={4}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Brückler, Hendrik and Bommes, David and Campen, Marcel}, year={2022}, pages={1–19} }","ama":"Brückler H, Bommes D, Campen M. Volume parametrization quantization for hexahedral meshing. <i>ACM Transactions on Graphics</i>. 2022;41(4):1-19. doi:<a href=\"https://doi.org/10.1145/3528223.3530123\">10.1145/3528223.3530123</a>","mla":"Brückler, Hendrik, et al. “Volume Parametrization Quantization for Hexahedral Meshing.” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, Association for Computing Machinery (ACM), 2022, pp. 1–19, doi:<a href=\"https://doi.org/10.1145/3528223.3530123\">10.1145/3528223.3530123</a>.","short":"H. Brückler, D. Bommes, M. Campen, ACM Transactions on Graphics 41 (2022) 1–19.","chicago":"Brückler, Hendrik, David Bommes, and Marcel Campen. “Volume Parametrization Quantization for Hexahedral Meshing.” <i>ACM Transactions on Graphics</i> 41, no. 4 (2022): 1–19. <a href=\"https://doi.org/10.1145/3528223.3530123\">https://doi.org/10.1145/3528223.3530123</a>.","ieee":"H. Brückler, D. Bommes, and M. Campen, “Volume parametrization quantization for hexahedral meshing,” <i>ACM Transactions on Graphics</i>, vol. 41, no. 4, pp. 1–19, 2022, doi: <a href=\"https://doi.org/10.1145/3528223.3530123\">10.1145/3528223.3530123</a>.","apa":"Brückler, H., Bommes, D., &#38; Campen, M. (2022). Volume parametrization quantization for hexahedral meshing. <i>ACM Transactions on Graphics</i>, <i>41</i>(4), 1–19. <a href=\"https://doi.org/10.1145/3528223.3530123\">https://doi.org/10.1145/3528223.3530123</a>"},"doi":"10.1145/3528223.3530123","language":[{"iso":"eng"}],"date_updated":"2025-07-14T12:47:23Z","publication_status":"published","intvolume":"        41","title":"Volume parametrization quantization for hexahedral meshing","year":"2022","author":[{"id":"115694","first_name":"Hendrik","last_name":"Brückler","full_name":"Brückler, Hendrik"},{"last_name":"Bommes","first_name":"David","full_name":"Bommes, David"},{"full_name":"Campen, Marcel","orcid":"0000-0003-2340-3462","last_name":"Campen","first_name":"Marcel","id":"114904"}],"publication_identifier":{"issn":["0730-0301","1557-7368"]},"type":"journal_article","department":[{"_id":"969"}],"date_created":"2025-06-25T09:07:20Z","abstract":[{"lang":"eng","text":"<jats:p>Developments in the field of parametrization-based quad mesh generation on surfaces have been impactful over the past decade. In this context, an important advance has been the replacement of error-prone rounding in the generation of integer-grid maps, by robust quantization methods. In parallel, parametrization-based hex mesh generation for volumes has been advanced. In this volumetric context, however, the state-of-the-art still relies on fragile rounding, not rarely producing defective meshes, especially when targeting a coarse mesh resolution. We present a method to robustly quantize volume parametrizations, i.e., to determine guaranteed valid choices of integers for 3D integer-grid maps. Inspired by the 2D case, we base our construction on a non-conforming cell decomposition of the volume, a 3D analogue of a T-mesh. In particular, we leverage the motorcycle complex, a recent generalization of the motorcycle graph, for this purpose. Integer values are expressed in a differential manner on the edges of this complex, enabling the efficient formulation of the conditions required to strictly prevent forcing the map into degeneration. Applying our method in the context of hexahedral meshing, we demonstrate that hexahedral meshes can be generated with significantly improved flexibility.</jats:p>"}],"extern":"1","issue":"4","publication":"ACM Transactions on Graphics"},{"citation":{"mla":"Pietroni, Nico, et al. “Hex-Mesh Generation and Processing: A Survey.” <i>ACM Transactions on Graphics</i>, vol. 42, no. 2, Association for Computing Machinery (ACM), 2022, pp. 1–44, doi:<a href=\"https://doi.org/10.1145/3554920\">10.1145/3554920</a>.","apa":"Pietroni, N., Campen, M., Sheffer, A., Cherchi, G., Bommes, D., Gao, X., Scateni, R., Ledoux, F., Remacle, J., &#38; Livesu, M. (2022). Hex-Mesh Generation and Processing: A Survey. <i>ACM Transactions on Graphics</i>, <i>42</i>(2), 1–44. <a href=\"https://doi.org/10.1145/3554920\">https://doi.org/10.1145/3554920</a>","ieee":"N. Pietroni <i>et al.</i>, “Hex-Mesh Generation and Processing: A Survey,” <i>ACM Transactions on Graphics</i>, vol. 42, no. 2, pp. 1–44, 2022, doi: <a href=\"https://doi.org/10.1145/3554920\">10.1145/3554920</a>.","chicago":"Pietroni, Nico, Marcel Campen, Alla Sheffer, Gianmarco Cherchi, David Bommes, Xifeng Gao, Riccardo Scateni, Franck Ledoux, Jean Remacle, and Marco Livesu. “Hex-Mesh Generation and Processing: A Survey.” <i>ACM Transactions on Graphics</i> 42, no. 2 (2022): 1–44. <a href=\"https://doi.org/10.1145/3554920\">https://doi.org/10.1145/3554920</a>.","ama":"Pietroni N, Campen M, Sheffer A, et al. Hex-Mesh Generation and Processing: A Survey. <i>ACM Transactions on Graphics</i>. 2022;42(2):1-44. doi:<a href=\"https://doi.org/10.1145/3554920\">10.1145/3554920</a>","short":"N. Pietroni, M. Campen, A. Sheffer, G. Cherchi, D. Bommes, X. Gao, R. Scateni, F. Ledoux, J. Remacle, M. Livesu, ACM Transactions on Graphics 42 (2022) 1–44.","bibtex":"@article{Pietroni_Campen_Sheffer_Cherchi_Bommes_Gao_Scateni_Ledoux_Remacle_Livesu_2022, title={Hex-Mesh Generation and Processing: A Survey}, volume={42}, DOI={<a href=\"https://doi.org/10.1145/3554920\">10.1145/3554920</a>}, number={2}, journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery (ACM)}, author={Pietroni, Nico and Campen, Marcel and Sheffer, Alla and Cherchi, Gianmarco and Bommes, David and Gao, Xifeng and Scateni, Riccardo and Ledoux, Franck and Remacle, Jean and Livesu, Marco}, year={2022}, pages={1–44} }"},"status":"public","_id":"60334","publisher":"Association for Computing Machinery (ACM)","page":"1-44","volume":42,"user_id":"117512","issue":"2","publication":"ACM Transactions on Graphics","extern":"1","abstract":[{"text":"<jats:p>In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as post-processing algorithms for connectivity editing and mesh optimization. For each technique, we highlight capabilities and limitations, also pointing out the associated unsolved challenges. Recent relaxed approaches, aiming to generate not pure-hex but hex-dominant meshes, are also discussed. The required background, pertaining to geometrical as well as combinatorial aspects, is introduced along the way.</jats:p>","lang":"eng"}],"date_created":"2025-06-23T10:36:34Z","department":[{"_id":"969"}],"type":"journal_article","author":[{"first_name":"Nico","last_name":"Pietroni","full_name":"Pietroni, Nico"},{"orcid":"0000-0003-2340-3462","first_name":"Marcel","last_name":"Campen","full_name":"Campen, Marcel","id":"114904"},{"first_name":"Alla","last_name":"Sheffer","full_name":"Sheffer, Alla"},{"full_name":"Cherchi, Gianmarco","first_name":"Gianmarco","last_name":"Cherchi"},{"last_name":"Bommes","first_name":"David","full_name":"Bommes, David"},{"last_name":"Gao","first_name":"Xifeng","full_name":"Gao, Xifeng"},{"first_name":"Riccardo","last_name":"Scateni","full_name":"Scateni, Riccardo"},{"full_name":"Ledoux, Franck","first_name":"Franck","last_name":"Ledoux"},{"full_name":"Remacle, Jean","first_name":"Jean","last_name":"Remacle"},{"first_name":"Marco","last_name":"Livesu","full_name":"Livesu, Marco"}],"publication_identifier":{"issn":["0730-0301","1557-7368"]},"title":"Hex-Mesh Generation and Processing: A Survey","year":"2022","intvolume":"        42","publication_status":"published","date_updated":"2025-07-14T12:48:37Z","language":[{"iso":"eng"}],"doi":"10.1145/3554920"},{"department":[{"_id":"34"}],"keyword":["fact checking · ensemble learning · knowledge graph veracit"],"type":"conference","date_created":"2022-08-02T11:56:03Z","file":[{"relation":"main_file","date_updated":"2022-12-22T15:45:29Z","file_name":"hybrid_fact_check_iswc2022.pdf","access_level":"closed","file_size":296218,"file_id":"34853","success":1,"content_type":"application/pdf","creator":"uqudus","date_created":"2022-12-22T15:45:29Z"}],"abstract":[{"text":" We consider fact-checking approaches that aim to predict the veracity of assertions in knowledge graphs. Five main categories of fact-checking approaches for knowledge graphs have been proposed in the recent literature, of\r\nwhich each is subject to partially overlapping limitations. In particular, current text-based approaches are limited by manual feature engineering. Path-based and rule-based approaches are limited by their exclusive use of knowledge graphs as background knowledge, and embedding-based approaches suffer from low accuracy scores on current fact-checking tasks. We propose a hybrid approach—dubbed HybridFC—that exploits the diversity of existing categories of fact-checking approaches within an ensemble learning setting to achieve a significantly better prediction performance. In particular, our approach outperforms the state of the art by 0.14 to 0.27 in terms of Area Under the Receiver Operating Characteristic curve on the FactBench dataset. Our code is open-source and can be found at https://github.com/dice-group/HybridFC.","lang":"eng"}],"publication":"The Semantic Web -- ISWC 2022","doi":"10.1007/978-3-031-19433-7_27","language":[{"iso":"eng"}],"date_updated":"2025-09-11T09:37:16Z","publication_status":"accepted","author":[{"full_name":"Qudus, Umair","first_name":"Umair","last_name":"Qudus","orcid":"0000-0001-6714-8729","id":"83392"},{"id":"67199","full_name":"Röder, Michael","orcid":"https://orcid.org/0000-0002-8609-8277","first_name":"Michael","last_name":"Röder"},{"full_name":"Saleem, Muhammad","last_name":"Saleem","first_name":"Muhammad"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"publication_identifier":{"isbn":["978-3-031-19433-7"]},"title":"HybridFC: A Hybrid Fact-Checking Approach for Knowledge Graphs","year":"2022","place":"Cham","project":[{"_id":"410","name":"KnowGraphs: KnowGraphs: Knowledge Graphs at Scale"}],"quality_controlled":"1","citation":{"ieee":"U. Qudus, M. Röder, M. Saleem, and A.-C. Ngonga Ngomo, “HybridFC: A Hybrid Fact-Checking Approach for Knowledge Graphs,” in <i>The Semantic Web -- ISWC 2022</i>, Hanghzou, China, pp. 462--480, doi: <a href=\"https://doi.org/10.1007/978-3-031-19433-7_27\">10.1007/978-3-031-19433-7_27</a>.","apa":"Qudus, U., Röder, M., Saleem, M., &#38; Ngonga Ngomo, A.-C. (n.d.). HybridFC: A Hybrid Fact-Checking Approach for Knowledge Graphs. In U. Sattler, A. Hogan, M. Keet, &#38; V. Presutti (Eds.), <i>The Semantic Web -- ISWC 2022</i> (pp. 462--480). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-19433-7_27\">https://doi.org/10.1007/978-3-031-19433-7_27</a>","short":"U. Qudus, M. Röder, M. Saleem, A.-C. Ngonga Ngomo, in: U. Sattler, A. Hogan, M. Keet, V. Presutti (Eds.), The Semantic Web -- ISWC 2022, Springer International Publishing, Cham, n.d., pp. 462--480.","chicago":"Qudus, Umair, Michael Röder, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “HybridFC: A Hybrid Fact-Checking Approach for Knowledge Graphs.” In <i>The Semantic Web -- ISWC 2022</i>, edited by Ulrike Sattler, Aidan Hogan, Maria Keet, and Valentina Presutti, 462--480. Cham: Springer International Publishing, n.d. <a href=\"https://doi.org/10.1007/978-3-031-19433-7_27\">https://doi.org/10.1007/978-3-031-19433-7_27</a>.","mla":"Qudus, Umair, et al. “HybridFC: A Hybrid Fact-Checking Approach for Knowledge Graphs.” <i>The Semantic Web -- ISWC 2022</i>, edited by Ulrike Sattler et al., Springer International Publishing, pp. 462--480, doi:<a href=\"https://doi.org/10.1007/978-3-031-19433-7_27\">10.1007/978-3-031-19433-7_27</a>.","bibtex":"@inproceedings{Qudus_Röder_Saleem_Ngonga Ngomo, place={Cham}, title={HybridFC: A Hybrid Fact-Checking Approach for Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-19433-7_27\">10.1007/978-3-031-19433-7_27</a>}, booktitle={The Semantic Web -- ISWC 2022}, publisher={Springer International Publishing}, author={Qudus, Umair and Röder, Michael and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, editor={Sattler, Ulrike and Hogan, Aidan and Keet, Maria and Presutti, Valentina}, pages={462--480} }","ama":"Qudus U, Röder M, Saleem M, Ngonga Ngomo A-C. HybridFC: A Hybrid Fact-Checking Approach for Knowledge Graphs. In: Sattler U, Hogan A, Keet M, Presutti V, eds. <i>The Semantic Web -- ISWC 2022</i>. Springer International Publishing; :462--480. doi:<a href=\"https://doi.org/10.1007/978-3-031-19433-7_27\">10.1007/978-3-031-19433-7_27</a>"},"popular_science":"1","file_date_updated":"2022-12-22T15:45:29Z","editor":[{"first_name":"Ulrike","last_name":"Sattler","full_name":"Sattler, Ulrike"},{"full_name":"Hogan, Aidan","first_name":"Aidan","last_name":"Hogan"},{"full_name":"Keet, Maria","first_name":"Maria","last_name":"Keet"},{"full_name":"Presutti, Valentina","first_name":"Valentina","last_name":"Presutti"}],"ddc":["000"],"user_id":"83392","_id":"32509","publisher":"Springer International Publishing","page":"462--480","has_accepted_license":"1","conference":{"location":"Hanghzou, China","name":"International Semantic Web Conference (ISWC)","start_date":"2022-10-23","end_date":"2022-10-27"},"status":"public"},{"date_created":"2024-02-19T06:36:17Z","department":[{"_id":"91"}],"type":"journal_article","citation":{"mla":"Hilgert, Joachim, et al. “Poisson Transforms for Trees of Bounded Degree.” <i>J. of Spectral Theory</i>, vol. 12, 2022, pp. 659–81.","bibtex":"@article{Hilgert_Weich_Bux_2022, title={Poisson transforms for trees of bounded degree}, volume={12}, journal={J. of Spectral Theory}, author={Hilgert, Joachim and Weich, Tobias and Bux, K.-U.}, year={2022}, pages={659–681} }","ama":"Hilgert J, Weich T, Bux K-U. Poisson transforms for trees of bounded degree. <i>J of Spectral Theory</i>. 2022;12:659-681.","ieee":"J. Hilgert, T. Weich, and K.-U. Bux, “Poisson transforms for trees of bounded degree,” <i>J. of Spectral Theory</i>, vol. 12, pp. 659–681, 2022.","apa":"Hilgert, J., Weich, T., &#38; Bux, K.-U. (2022). Poisson transforms for trees of bounded degree. <i>J. of Spectral Theory</i>, <i>12</i>, 659–681.","short":"J. Hilgert, T. Weich, K.-U. Bux, J. of Spectral Theory 12 (2022) 659–681.","chicago":"Hilgert, Joachim, Tobias Weich, and K.-U. Bux. “Poisson Transforms for Trees of Bounded Degree.” <i>J. of Spectral Theory</i> 12 (2022): 659–81."},"publication":"J. of Spectral Theory","language":[{"iso":"eng"}],"_id":"51385","page":"659-681","volume":12,"user_id":"220","author":[{"id":"220","full_name":"Hilgert, Joachim","last_name":"Hilgert","first_name":"Joachim"},{"full_name":"Weich, Tobias","first_name":"Tobias","last_name":"Weich","orcid":"0000-0002-9648-6919","id":"49178"},{"full_name":"Bux, K.-U.","first_name":"K.-U.","last_name":"Bux"}],"status":"public","title":"Poisson transforms for trees of bounded degree","year":"2022","intvolume":"        12","date_updated":"2026-03-31T08:25:35Z","publication_status":"published"},{"status":"public","_id":"27160","page":"1-27","volume":215,"user_id":"71541","citation":{"ama":"Gharibian S, Rudolph D. On polynomially many queries to NP or QMA oracles. In: <i>13th Innovations in Theoretical Computer Science (ITCS 2022)</i>. Vol 215. ; 2022:1-27. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2022.75\">10.4230/LIPIcs.ITCS.2022.75</a>","bibtex":"@inproceedings{Gharibian_Rudolph_2022, title={On polynomially many queries to NP or QMA oracles}, volume={215}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2022.75\">10.4230/LIPIcs.ITCS.2022.75</a>}, number={75}, booktitle={13th Innovations in Theoretical Computer Science (ITCS 2022)}, author={Gharibian, Sevag and Rudolph, Dorian}, year={2022}, pages={1–27} }","mla":"Gharibian, Sevag, and Dorian Rudolph. “On Polynomially Many Queries to NP or QMA Oracles.” <i>13th Innovations in Theoretical Computer Science (ITCS 2022)</i>, vol. 215, no. 75, 2022, pp. 1–27, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2022.75\">10.4230/LIPIcs.ITCS.2022.75</a>.","short":"S. Gharibian, D. Rudolph, in: 13th Innovations in Theoretical Computer Science (ITCS 2022), 2022, pp. 1–27.","chicago":"Gharibian, Sevag, and Dorian Rudolph. “On Polynomially Many Queries to NP or QMA Oracles.” In <i>13th Innovations in Theoretical Computer Science (ITCS 2022)</i>, 215:1–27, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2022.75\">https://doi.org/10.4230/LIPIcs.ITCS.2022.75</a>.","apa":"Gharibian, S., &#38; Rudolph, D. (2022). On polynomially many queries to NP or QMA oracles. <i>13th Innovations in Theoretical Computer Science (ITCS 2022)</i>, <i>215</i>(75), 1–27. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2022.75\">https://doi.org/10.4230/LIPIcs.ITCS.2022.75</a>","ieee":"S. Gharibian and D. Rudolph, “On polynomially many queries to NP or QMA oracles,” in <i>13th Innovations in Theoretical Computer Science (ITCS 2022)</i>, 2022, vol. 215, no. 75, pp. 1–27, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2022.75\">10.4230/LIPIcs.ITCS.2022.75</a>."},"oa":"1","author":[{"first_name":"Sevag","last_name":"Gharibian","orcid":"0000-0002-9992-3379","full_name":"Gharibian, Sevag","id":"71541"},{"id":"57863","full_name":"Rudolph, Dorian","first_name":"Dorian","last_name":"Rudolph"}],"year":"2022","title":"On polynomially many queries to NP or QMA oracles","intvolume":"       215","date_updated":"2026-04-30T14:11:00Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=15671","open_access":"1"}],"doi":"10.4230/LIPIcs.ITCS.2022.75","issue":"75","publication":"13th Innovations in Theoretical Computer Science (ITCS 2022)","abstract":[{"lang":"eng","text":"We study the complexity of problems solvable in deterministic polynomial time\r\nwith access to an NP or Quantum Merlin-Arthur (QMA)-oracle, such as $P^{NP}$\r\nand $P^{QMA}$, respectively. The former allows one to classify problems more\r\nfinely than the Polynomial-Time Hierarchy (PH), whereas the latter\r\ncharacterizes physically motivated problems such as Approximate Simulation\r\n(APX-SIM) [Ambainis, CCC 2014]. In this area, a central role has been played by\r\nthe classes $P^{NP[\\log]}$ and $P^{QMA[\\log]}$, defined identically to $P^{NP}$\r\nand $P^{QMA}$, except that only logarithmically many oracle queries are\r\nallowed. Here, [Gottlob, FOCS 1993] showed that if the adaptive queries made by\r\na $P^{NP}$ machine have a \"query graph\" which is a tree, then this computation\r\ncan be simulated in $P^{NP[\\log]}$.\r\n  In this work, we first show that for any verification class\r\n$C\\in\\{NP,MA,QCMA,QMA,QMA(2),NEXP,QMA_{\\exp}\\}$, any $P^C$ machine with a query\r\ngraph of \"separator number\" $s$ can be simulated using deterministic time\r\n$\\exp(s\\log n)$ and $s\\log n$ queries to a $C$-oracle. When $s\\in O(1)$ (which\r\nincludes the case of $O(1)$-treewidth, and thus also of trees), this gives an\r\nupper bound of $P^{C[\\log]}$, and when $s\\in O(\\log^k(n))$, this yields bound\r\n$QP^{C[\\log^{k+1}]}$ (QP meaning quasi-polynomial time). We next show how to\r\ncombine Gottlob's \"admissible-weighting function\" framework with the\r\n\"flag-qubit\" framework of [Watson, Bausch, Gharibian, 2020], obtaining a\r\nunified approach for embedding $P^C$ computations directly into APX-SIM\r\ninstances in a black-box fashion. Finally, we formalize a simple no-go\r\nstatement about polynomials (c.f. [Krentel, STOC 1986]): Given a multi-linear\r\npolynomial $p$ specified via an arithmetic circuit, if one can \"weakly\r\ncompress\" $p$ so that its optimal value requires $m$ bits to represent, then\r\n$P^{NP}$ can be decided with only $m$ queries to an NP-oracle."}],"date_created":"2021-11-05T08:08:29Z","department":[{"_id":"623"},{"_id":"7"}],"type":"conference"},{"_id":"44537","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2207.02278"}],"user_id":"72064","author":[{"id":"72064","full_name":"Burban, Igor","first_name":"Igor","last_name":"Burban"},{"last_name":"Alfes-Neumann","first_name":"C.","full_name":"Alfes-Neumann, C."},{"full_name":"Raum, M.","last_name":"Raum","first_name":"M."}],"year":"2022","status":"public","title":"A classification of polyharmonic Maaß forms via quiver representations","date_updated":"2026-07-07T06:20:58Z","publication_status":"published","date_created":"2023-05-07T00:54:50Z","department":[{"_id":"602"}],"type":"preprint","citation":{"mla":"Burban, Igor, et al. <i>A Classification of Polyharmonic Maaß Forms via Quiver Representations</i>. 2022.","ama":"Burban I, Alfes-Neumann C, Raum M. A classification of polyharmonic Maaß forms via quiver representations. Published online 2022.","bibtex":"@article{Burban_Alfes-Neumann_Raum_2022, title={A classification of polyharmonic Maaß forms via quiver representations}, author={Burban, Igor and Alfes-Neumann, C. and Raum, M.}, year={2022} }","apa":"Burban, I., Alfes-Neumann, C., &#38; Raum, M. (2022). <i>A classification of polyharmonic Maaß forms via quiver representations</i>.","ieee":"I. Burban, C. Alfes-Neumann, and M. Raum, “A classification of polyharmonic Maaß forms via quiver representations.” 2022.","chicago":"Burban, Igor, C. Alfes-Neumann, and M. Raum. “A Classification of Polyharmonic Maaß Forms via Quiver Representations,” 2022.","short":"I. Burban, C. Alfes-Neumann, M. Raum, (2022)."}},{"author":[{"last_name":"Fathi Ahmed","first_name":"Abdullah","full_name":"Fathi Ahmed, Abdullah"},{"last_name":"Ahmed Sherif","first_name":"Mohamed","full_name":"Ahmed Sherif, Mohamed"},{"id":"71635","full_name":"Moussallem, Diego","last_name":"Moussallem","first_name":"Diego"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"year":"2021","title":"Multilingual Verbalization and Summarization for Explainable Link Discovery","status":"public","intvolume":"       133","date_updated":"2022-01-06T06:56:33Z","_id":"24721","language":[{"iso":"eng"}],"page":"101874","volume":133,"doi":"10.1016/j.datak.2021.101874","user_id":"65716","citation":{"apa":"Fathi Ahmed, A., Ahmed Sherif, M., Moussallem, D., &#38; Ngonga Ngomo, A.-C. (2021). Multilingual Verbalization and Summarization for Explainable Link Discovery. <i>Data Knowl. Eng.</i>, <i>133</i>, 101874. <a href=\"https://doi.org/10.1016/j.datak.2021.101874\">https://doi.org/10.1016/j.datak.2021.101874</a>","ieee":"A. Fathi Ahmed, M. Ahmed Sherif, D. Moussallem, and A.-C. Ngonga Ngomo, “Multilingual Verbalization and Summarization for Explainable Link Discovery,” <i>Data Knowl. Eng.</i>, vol. 133, p. 101874, 2021, doi: <a href=\"https://doi.org/10.1016/j.datak.2021.101874\">10.1016/j.datak.2021.101874</a>.","chicago":"Fathi Ahmed, Abdullah, Mohamed Ahmed Sherif, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. “Multilingual Verbalization and Summarization for Explainable Link Discovery.” <i>Data Knowl. Eng.</i> 133 (2021): 101874. <a href=\"https://doi.org/10.1016/j.datak.2021.101874\">https://doi.org/10.1016/j.datak.2021.101874</a>.","short":"A. Fathi Ahmed, M. Ahmed Sherif, D. Moussallem, A.-C. Ngonga Ngomo, Data Knowl. Eng. 133 (2021) 101874.","mla":"Fathi Ahmed, Abdullah, et al. “Multilingual Verbalization and Summarization for Explainable Link Discovery.” <i>Data Knowl. Eng.</i>, vol. 133, 2021, p. 101874, doi:<a href=\"https://doi.org/10.1016/j.datak.2021.101874\">10.1016/j.datak.2021.101874</a>.","ama":"Fathi Ahmed A, Ahmed Sherif M, Moussallem D, Ngonga Ngomo A-C. Multilingual Verbalization and Summarization for Explainable Link Discovery. <i>Data Knowl Eng</i>. 2021;133:101874. doi:<a href=\"https://doi.org/10.1016/j.datak.2021.101874\">10.1016/j.datak.2021.101874</a>","bibtex":"@article{Fathi Ahmed_Ahmed Sherif_Moussallem_Ngonga Ngomo_2021, title={Multilingual Verbalization and Summarization for Explainable Link Discovery}, volume={133}, DOI={<a href=\"https://doi.org/10.1016/j.datak.2021.101874\">10.1016/j.datak.2021.101874</a>}, journal={Data Knowl. Eng.}, author={Fathi Ahmed, Abdullah and Ahmed Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2021}, pages={101874} }"},"publication":"Data Knowl. Eng.","date_created":"2021-09-20T13:04:11Z","department":[{"_id":"574"}],"type":"journal_article"},{"year":"2021","status":"public","title":"Applying Grammar-Based Compression to RDF","author":[{"full_name":"Röder, Michael","first_name":"Michael","last_name":"Röder"},{"first_name":"Philip","last_name":"Frerk","full_name":"Frerk, Philip"},{"full_name":"Conrads, Felix","first_name":"Felix","last_name":"Conrads"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_updated":"2022-01-06T06:56:33Z","intvolume":"     12731","page":"93-108","series_title":"Lecture Notes in Computer Science","_id":"24722","language":[{"iso":"eng"}],"publisher":"Springer","doi":"10.1007/978-3-030-77385-4\\_6","user_id":"65716","editor":[{"full_name":"Verborgh, Ruben","last_name":"Verborgh","first_name":"Ruben"},{"full_name":"Hose, Katja","first_name":"Katja","last_name":"Hose"},{"first_name":"Heiko","last_name":"Paulheim","full_name":"Paulheim, Heiko"},{"full_name":"Champin, Pierre-Antoine","first_name":"Pierre-Antoine","last_name":"Champin"},{"full_name":"Maleshkova, Maria","last_name":"Maleshkova","first_name":"Maria"},{"full_name":"Corcho, Oscar","first_name":"Oscar","last_name":"Corcho"},{"full_name":"Ristoski, Petar","last_name":"Ristoski","first_name":"Petar"},{"first_name":"Mehwish","last_name":"Alam","full_name":"Alam, Mehwish"}],"volume":12731,"publication":"The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings","citation":{"mla":"Röder, Michael, et al. “Applying Grammar-Based Compression to RDF.” <i>The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings</i>, edited by Ruben Verborgh et al., vol. 12731, Springer, 2021, pp. 93–108, doi:<a href=\"https://doi.org/10.1007/978-3-030-77385-4\\_6\">10.1007/978-3-030-77385-4\\_6</a>.","ama":"Röder M, Frerk P, Conrads F, Ngonga Ngomo A-C. Applying Grammar-Based Compression to RDF. In: Verborgh R, Hose K, Paulheim H, et al., eds. <i>The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings</i>. Vol 12731. Lecture Notes in Computer Science. Springer; 2021:93-108. doi:<a href=\"https://doi.org/10.1007/978-3-030-77385-4\\_6\">10.1007/978-3-030-77385-4\\_6</a>","bibtex":"@inproceedings{Röder_Frerk_Conrads_Ngonga Ngomo_2021, series={Lecture Notes in Computer Science}, title={Applying Grammar-Based Compression to RDF}, volume={12731}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-77385-4\\_6\">10.1007/978-3-030-77385-4\\_6</a>}, booktitle={The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings}, publisher={Springer}, author={Röder, Michael and Frerk, Philip and Conrads, Felix and Ngonga Ngomo, Axel-Cyrille}, editor={Verborgh, Ruben and Hose, Katja and Paulheim, Heiko and Champin, Pierre-Antoine and Maleshkova, Maria and Corcho, Oscar and Ristoski, Petar and Alam, Mehwish}, year={2021}, pages={93–108}, collection={Lecture Notes in Computer Science} }","apa":"Röder, M., Frerk, P., Conrads, F., &#38; Ngonga Ngomo, A.-C. (2021). Applying Grammar-Based Compression to RDF. In R. Verborgh, K. Hose, H. Paulheim, P.-A. Champin, M. Maleshkova, O. Corcho, P. Ristoski, &#38; M. Alam (Eds.), <i>The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings</i> (Vol. 12731, pp. 93–108). Springer. <a href=\"https://doi.org/10.1007/978-3-030-77385-4\\_6\">https://doi.org/10.1007/978-3-030-77385-4\\_6</a>","ieee":"M. Röder, P. Frerk, F. Conrads, and A.-C. Ngonga Ngomo, “Applying Grammar-Based Compression to RDF,” in <i>The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings</i>, 2021, vol. 12731, pp. 93–108, doi: <a href=\"https://doi.org/10.1007/978-3-030-77385-4\\_6\">10.1007/978-3-030-77385-4\\_6</a>.","short":"M. Röder, P. Frerk, F. Conrads, A.-C. Ngonga Ngomo, in: R. Verborgh, K. Hose, H. Paulheim, P.-A. Champin, M. Maleshkova, O. Corcho, P. Ristoski, M. Alam (Eds.), The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings, Springer, 2021, pp. 93–108.","chicago":"Röder, Michael, Philip Frerk, Felix Conrads, and Axel-Cyrille Ngonga Ngomo. “Applying Grammar-Based Compression to RDF.” In <i>The Semantic Web - 18th International Conference, {ESWC} 2021, Virtual Event, June 6-10, 2021, Proceedings</i>, edited by Ruben Verborgh, Katja Hose, Heiko Paulheim, Pierre-Antoine Champin, Maria Maleshkova, Oscar Corcho, Petar Ristoski, and Mehwish Alam, 12731:93–108. Lecture Notes in Computer Science. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-77385-4\\_6\">https://doi.org/10.1007/978-3-030-77385-4\\_6</a>."},"date_created":"2021-09-20T13:07:40Z","type":"conference","department":[{"_id":"574"}]},{"date_created":"2021-09-20T13:12:07Z","type":"conference","department":[{"_id":"574"}],"publication":"The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers","citation":{"short":"M. Ali, M. Saleem, A.-C. Ngonga Ngomo, in: R. Verborgh, A. Dimou, A. Hogan, C. d’Amato, I. Tiddi, A. Br{\\\"{o}}ring, S. Maier, F. Ongenae, R. Tommasini, M. Alam (Eds.), The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers, Springer, 2021, pp. 136–140.","chicago":"Ali, Manzoor, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “Unsupervised Relation Extraction Using Sentence Encoding.” In <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i>, edited by Ruben Verborgh, Anastasia Dimou, Aidan Hogan, Claudia d’Amato, Ilaria Tiddi, Arne Br{\\\"{o}}ring, Simon Maier, Femke Ongenae, Riccardo Tommasini, and Mehwish Alam, 12739:136–40. Lecture Notes in Computer Science. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">https://doi.org/10.1007/978-3-030-80418-3\\_25</a>.","apa":"Ali, M., Saleem, M., &#38; Ngonga Ngomo, A.-C. (2021). Unsupervised Relation Extraction Using Sentence Encoding. In R. Verborgh, A. Dimou, A. Hogan, C. d’Amato, I. Tiddi, A. Br{\\\"{o}}ring, S. Maier, F. Ongenae, R. Tommasini, &#38; M. Alam (Eds.), <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i> (Vol. 12739, pp. 136–140). Springer. <a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">https://doi.org/10.1007/978-3-030-80418-3\\_25</a>","ieee":"M. Ali, M. Saleem, and A.-C. Ngonga Ngomo, “Unsupervised Relation Extraction Using Sentence Encoding,” in <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i>, 2021, vol. 12739, pp. 136–140, doi: <a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">10.1007/978-3-030-80418-3\\_25</a>.","ama":"Ali M, Saleem M, Ngonga Ngomo A-C. Unsupervised Relation Extraction Using Sentence Encoding. In: Verborgh R, Dimou A, Hogan A, et al., eds. <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i>. Vol 12739. Lecture Notes in Computer Science. Springer; 2021:136-140. doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">10.1007/978-3-030-80418-3\\_25</a>","bibtex":"@inproceedings{Ali_Saleem_Ngonga Ngomo_2021, series={Lecture Notes in Computer Science}, title={Unsupervised Relation Extraction Using Sentence Encoding}, volume={12739}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">10.1007/978-3-030-80418-3\\_25</a>}, booktitle={The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers}, publisher={Springer}, author={Ali, Manzoor and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, editor={Verborgh, Ruben and Dimou, Anastasia and Hogan, Aidan and d’Amato, Claudia and Tiddi, Ilaria and Br{\\\"{o}}ring, Arne and Maier, Simon and Ongenae, Femke and Tommasini, Riccardo and Alam, Mehwish}, year={2021}, pages={136–140}, collection={Lecture Notes in Computer Science} }","mla":"Ali, Manzoor, et al. “Unsupervised Relation Extraction Using Sentence Encoding.” <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i>, edited by Ruben Verborgh et al., vol. 12739, Springer, 2021, pp. 136–40, doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">10.1007/978-3-030-80418-3\\_25</a>."},"page":"136-140","series_title":"Lecture Notes in Computer Science","_id":"24723","publisher":"Springer","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-80418-3\\_25","user_id":"65716","editor":[{"full_name":"Verborgh, Ruben","last_name":"Verborgh","first_name":"Ruben"},{"full_name":"Dimou, Anastasia","first_name":"Anastasia","last_name":"Dimou"},{"full_name":"Hogan, Aidan","first_name":"Aidan","last_name":"Hogan"},{"first_name":"Claudia","last_name":"d'Amato","full_name":"d'Amato, Claudia"},{"last_name":"Tiddi","first_name":"Ilaria","full_name":"Tiddi, Ilaria"},{"full_name":"Br{\\\"{o}}ring, Arne","first_name":"Arne","last_name":"Br{\\\"{o}}ring"},{"last_name":"Maier","first_name":"Simon","full_name":"Maier, Simon"},{"full_name":"Ongenae, Femke","first_name":"Femke","last_name":"Ongenae"},{"first_name":"Riccardo","last_name":"Tommasini","full_name":"Tommasini, Riccardo"},{"first_name":"Mehwish","last_name":"Alam","full_name":"Alam, Mehwish"}],"volume":12739,"title":"Unsupervised Relation Extraction Using Sentence Encoding","year":"2021","status":"public","author":[{"full_name":"Ali, Manzoor","last_name":"Ali","first_name":"Manzoor"},{"first_name":"Muhammad","last_name":"Saleem","full_name":"Saleem, Muhammad"},{"id":"65716","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"date_updated":"2022-01-06T06:56:33Z","intvolume":"     12739"},{"type":"conference","department":[{"_id":"574"}],"date_created":"2021-09-20T13:13:12Z","publication":"The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers","citation":{"mla":"Ali, Manzoor, et al. “Unsupervised Relation Extraction Using Sentence Encoding.” <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i>, edited by Ruben Verborgh et al., vol. 12739, Springer, 2021, pp. 136–40, doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">10.1007/978-3-030-80418-3\\_25</a>.","ama":"Ali M, Saleem M, Ngonga Ngomo A-C. Unsupervised Relation Extraction Using Sentence Encoding. In: Verborgh R, Dimou A, Hogan A, et al., eds. <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i>. Vol 12739. Lecture Notes in Computer Science. Springer; 2021:136-140. doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">10.1007/978-3-030-80418-3\\_25</a>","bibtex":"@inproceedings{Ali_Saleem_Ngonga Ngomo_2021, series={Lecture Notes in Computer Science}, title={Unsupervised Relation Extraction Using Sentence Encoding}, volume={12739}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">10.1007/978-3-030-80418-3\\_25</a>}, booktitle={The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers}, publisher={Springer}, author={Ali, Manzoor and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, editor={Verborgh, Ruben and Dimou, Anastasia and Hogan, Aidan and d’Amato, Claudia and Tiddi, Ilaria and Br{\\\"{o}}ring, Arne and Maier, Simon and Ongenae, Femke and Tommasini, Riccardo and Alam, Mehwish}, year={2021}, pages={136–140}, collection={Lecture Notes in Computer Science} }","apa":"Ali, M., Saleem, M., &#38; Ngonga Ngomo, A.-C. (2021). Unsupervised Relation Extraction Using Sentence Encoding. In R. Verborgh, A. Dimou, A. Hogan, C. d’Amato, I. Tiddi, A. Br{\\\"{o}}ring, S. Maier, F. Ongenae, R. Tommasini, &#38; M. Alam (Eds.), <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i> (Vol. 12739, pp. 136–140). Springer. <a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">https://doi.org/10.1007/978-3-030-80418-3\\_25</a>","ieee":"M. Ali, M. Saleem, and A.-C. Ngonga Ngomo, “Unsupervised Relation Extraction Using Sentence Encoding,” in <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i>, 2021, vol. 12739, pp. 136–140, doi: <a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">10.1007/978-3-030-80418-3\\_25</a>.","short":"M. Ali, M. Saleem, A.-C. Ngonga Ngomo, in: R. Verborgh, A. Dimou, A. Hogan, C. d’Amato, I. Tiddi, A. Br{\\\"{o}}ring, S. Maier, F. Ongenae, R. Tommasini, M. Alam (Eds.), The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers, Springer, 2021, pp. 136–140.","chicago":"Ali, Manzoor, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “Unsupervised Relation Extraction Using Sentence Encoding.” In <i>The Semantic Web: {ESWC} 2021 Satellite Events - Virtual Event, June 6-10, 2021, Revised Selected Papers</i>, edited by Ruben Verborgh, Anastasia Dimou, Aidan Hogan, Claudia d’Amato, Ilaria Tiddi, Arne Br{\\\"{o}}ring, Simon Maier, Femke Ongenae, Riccardo Tommasini, and Mehwish Alam, 12739:136–40. Lecture Notes in Computer Science. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-80418-3\\_25\">https://doi.org/10.1007/978-3-030-80418-3\\_25</a>."},"user_id":"65716","doi":"10.1007/978-3-030-80418-3\\_25","volume":12739,"editor":[{"full_name":"Verborgh, Ruben","last_name":"Verborgh","first_name":"Ruben"},{"last_name":"Dimou","first_name":"Anastasia","full_name":"Dimou, Anastasia"},{"first_name":"Aidan","last_name":"Hogan","full_name":"Hogan, Aidan"},{"full_name":"d'Amato, Claudia","last_name":"d'Amato","first_name":"Claudia"},{"full_name":"Tiddi, Ilaria","first_name":"Ilaria","last_name":"Tiddi"},{"full_name":"Br{\\\"{o}}ring, Arne","last_name":"Br{\\\"{o}}ring","first_name":"Arne"},{"last_name":"Maier","first_name":"Simon","full_name":"Maier, Simon"},{"first_name":"Femke","last_name":"Ongenae","full_name":"Ongenae, Femke"},{"last_name":"Tommasini","first_name":"Riccardo","full_name":"Tommasini, Riccardo"},{"full_name":"Alam, Mehwish","first_name":"Mehwish","last_name":"Alam"}],"page":"136-140","language":[{"iso":"eng"}],"_id":"24724","publisher":"Springer","series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:56:33Z","intvolume":"     12739","title":"Unsupervised Relation Extraction Using Sentence Encoding","year":"2021","status":"public","author":[{"full_name":"Ali, Manzoor","first_name":"Manzoor","last_name":"Ali"},{"full_name":"Saleem, Muhammad","first_name":"Muhammad","last_name":"Saleem"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716"}]},{"date_created":"2021-09-20T13:13:49Z","department":[{"_id":"574"}],"type":"conference","citation":{"chicago":"Shahzad, Moemmur, Ayesha Amin, Diego Esteves, and Axel-Cyrille Ngonga Ngomo. “InferNER: An Attentive Model Leveraging the Sentence-Level Information for Named Entity Recognition in Microblogs.” In <i>Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, May 17-19, 2021</i>, edited by Eric Bell and Fazel Keshtkar, 2021. <a href=\"https://doi.org/10.32473/flairs.v34i1.128538\">https://doi.org/10.32473/flairs.v34i1.128538</a>.","short":"M. Shahzad, A. Amin, D. Esteves, A.-C. Ngonga Ngomo, in: E. Bell, F. Keshtkar (Eds.), Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, May 17-19, 2021, 2021.","ieee":"M. Shahzad, A. Amin, D. Esteves, and A.-C. Ngonga Ngomo, “InferNER: an attentive model leveraging the sentence-level information for Named Entity Recognition in Microblogs,” in <i>Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, May 17-19, 2021</i>, 2021, doi: <a href=\"https://doi.org/10.32473/flairs.v34i1.128538\">10.32473/flairs.v34i1.128538</a>.","apa":"Shahzad, M., Amin, A., Esteves, D., &#38; Ngonga Ngomo, A.-C. (2021). InferNER: an attentive model leveraging the sentence-level information for Named Entity Recognition in Microblogs. In E. Bell &#38; F. Keshtkar (Eds.), <i>Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, May 17-19, 2021</i>. <a href=\"https://doi.org/10.32473/flairs.v34i1.128538\">https://doi.org/10.32473/flairs.v34i1.128538</a>","bibtex":"@inproceedings{Shahzad_Amin_Esteves_Ngonga Ngomo_2021, title={InferNER: an attentive model leveraging the sentence-level information for Named Entity Recognition in Microblogs}, DOI={<a href=\"https://doi.org/10.32473/flairs.v34i1.128538\">10.32473/flairs.v34i1.128538</a>}, booktitle={Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, May 17-19, 2021}, author={Shahzad, Moemmur and Amin, Ayesha and Esteves, Diego and Ngonga Ngomo, Axel-Cyrille}, editor={Bell, Eric and Keshtkar, Fazel}, year={2021} }","ama":"Shahzad M, Amin A, Esteves D, Ngonga Ngomo A-C. InferNER: an attentive model leveraging the sentence-level information for Named Entity Recognition in Microblogs. In: Bell E, Keshtkar F, eds. <i>Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, May 17-19, 2021</i>. ; 2021. doi:<a href=\"https://doi.org/10.32473/flairs.v34i1.128538\">10.32473/flairs.v34i1.128538</a>","mla":"Shahzad, Moemmur, et al. “InferNER: An Attentive Model Leveraging the Sentence-Level Information for Named Entity Recognition in Microblogs.” <i>Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, May 17-19, 2021</i>, edited by Eric Bell and Fazel Keshtkar, 2021, doi:<a href=\"https://doi.org/10.32473/flairs.v34i1.128538\">10.32473/flairs.v34i1.128538</a>."},"publication":"Proceedings of the Thirty-Fourth International Florida Artificial Intelligence Research Society Conference, North Miami Beach, Florida, USA, May 17-19, 2021","_id":"24725","language":[{"iso":"eng"}],"editor":[{"full_name":"Bell, Eric","last_name":"Bell","first_name":"Eric"},{"full_name":"Keshtkar, Fazel","last_name":"Keshtkar","first_name":"Fazel"}],"doi":"10.32473/flairs.v34i1.128538","user_id":"65716","author":[{"first_name":"Moemmur","last_name":"Shahzad","full_name":"Shahzad, Moemmur"},{"first_name":"Ayesha","last_name":"Amin","full_name":"Amin, Ayesha"},{"first_name":"Diego","last_name":"Esteves","full_name":"Esteves, Diego"},{"id":"65716","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"title":"InferNER: an attentive model leveraging the sentence-level information for Named Entity Recognition in Microblogs","year":"2021","status":"public","date_updated":"2022-01-06T06:56:33Z"},{"user_id":"65716","doi":"10.1109/ICSC50631.2021.00015","_id":"24726","publisher":"{IEEE}","language":[{"iso":"eng"}],"page":"62-69","date_updated":"2022-01-06T06:56:33Z","author":[{"full_name":"Röder, Michael","last_name":"Röder","first_name":"Michael"},{"last_name":"Thuy Sy Nguyen","first_name":"Pham","full_name":"Thuy Sy Nguyen, Pham"},{"last_name":"Conrads","first_name":"Felix","full_name":"Conrads, Felix"},{"full_name":"Alexandra Morim da Silva, Ana","last_name":"Alexandra Morim da Silva","first_name":"Ana"},{"id":"65716","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"year":"2021","status":"public","title":"Lemming - Example-based Mimicking of Knowledge Graphs","department":[{"_id":"574"}],"type":"conference","date_created":"2021-09-20T13:14:21Z","citation":{"bibtex":"@inproceedings{Röder_Thuy Sy Nguyen_Conrads_Alexandra Morim da Silva_Ngonga Ngomo_2021, title={Lemming - Example-based Mimicking of Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.1109/ICSC50631.2021.00015\">10.1109/ICSC50631.2021.00015</a>}, booktitle={15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}, publisher={{IEEE}}, author={Röder, Michael and Thuy Sy Nguyen, Pham and Conrads, Felix and Alexandra Morim da Silva, Ana and Ngonga Ngomo, Axel-Cyrille}, year={2021}, pages={62–69} }","ama":"Röder M, Thuy Sy Nguyen P, Conrads F, Alexandra Morim da Silva A, Ngonga Ngomo A-C. Lemming - Example-based Mimicking of Knowledge Graphs. In: <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>. {IEEE}; 2021:62-69. doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00015\">10.1109/ICSC50631.2021.00015</a>","mla":"Röder, Michael, et al. “Lemming - Example-Based Mimicking of Knowledge Graphs.” <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, {IEEE}, 2021, pp. 62–69, doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00015\">10.1109/ICSC50631.2021.00015</a>.","short":"M. Röder, P. Thuy Sy Nguyen, F. Conrads, A. Alexandra Morim da Silva, A.-C. Ngonga Ngomo, in: 15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021, {IEEE}, 2021, pp. 62–69.","chicago":"Röder, Michael, Pham Thuy Sy Nguyen, Felix Conrads, Ana Alexandra Morim da Silva, and Axel-Cyrille Ngonga Ngomo. “Lemming - Example-Based Mimicking of Knowledge Graphs.” In <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 62–69. {IEEE}, 2021. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00015\">https://doi.org/10.1109/ICSC50631.2021.00015</a>.","ieee":"M. Röder, P. Thuy Sy Nguyen, F. Conrads, A. Alexandra Morim da Silva, and A.-C. Ngonga Ngomo, “Lemming - Example-based Mimicking of Knowledge Graphs,” in <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 2021, pp. 62–69, doi: <a href=\"https://doi.org/10.1109/ICSC50631.2021.00015\">10.1109/ICSC50631.2021.00015</a>.","apa":"Röder, M., Thuy Sy Nguyen, P., Conrads, F., Alexandra Morim da Silva, A., &#38; Ngonga Ngomo, A.-C. (2021). Lemming - Example-based Mimicking of Knowledge Graphs. <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 62–69. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00015\">https://doi.org/10.1109/ICSC50631.2021.00015</a>"},"publication":"15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021"},{"date_created":"2021-09-20T13:15:06Z","type":"conference","department":[{"_id":"574"}],"publication":"15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021","citation":{"mla":"Amer Desouki, Abdelmoneim, et al. “SYNTHG: Mimicking RDF Graphs Using Tensor Factorization.” <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, {IEEE}, 2021, pp. 76–79, doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00017\">10.1109/ICSC50631.2021.00017</a>.","bibtex":"@inproceedings{Amer Desouki_Conrads_Röder_Ngonga Ngomo_2021, title={SYNTHG: Mimicking RDF Graphs Using Tensor Factorization}, DOI={<a href=\"https://doi.org/10.1109/ICSC50631.2021.00017\">10.1109/ICSC50631.2021.00017</a>}, booktitle={15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}, publisher={{IEEE}}, author={Amer Desouki, Abdelmoneim and Conrads, Felix and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}, year={2021}, pages={76–79} }","ama":"Amer Desouki A, Conrads F, Röder M, Ngonga Ngomo A-C. SYNTHG: Mimicking RDF Graphs Using Tensor Factorization. In: <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>. {IEEE}; 2021:76-79. doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00017\">10.1109/ICSC50631.2021.00017</a>","ieee":"A. Amer Desouki, F. Conrads, M. Röder, and A.-C. Ngonga Ngomo, “SYNTHG: Mimicking RDF Graphs Using Tensor Factorization,” in <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 2021, pp. 76–79, doi: <a href=\"https://doi.org/10.1109/ICSC50631.2021.00017\">10.1109/ICSC50631.2021.00017</a>.","apa":"Amer Desouki, A., Conrads, F., Röder, M., &#38; Ngonga Ngomo, A.-C. (2021). SYNTHG: Mimicking RDF Graphs Using Tensor Factorization. <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 76–79. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00017\">https://doi.org/10.1109/ICSC50631.2021.00017</a>","chicago":"Amer Desouki, Abdelmoneim, Felix Conrads, Michael Röder, and Axel-Cyrille Ngonga Ngomo. “SYNTHG: Mimicking RDF Graphs Using Tensor Factorization.” In <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 76–79. {IEEE}, 2021. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00017\">https://doi.org/10.1109/ICSC50631.2021.00017</a>.","short":"A. Amer Desouki, F. Conrads, M. Röder, A.-C. Ngonga Ngomo, in: 15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021, {IEEE}, 2021, pp. 76–79."},"page":"76-79","language":[{"iso":"eng"}],"_id":"24727","publisher":"{IEEE}","user_id":"65716","doi":"10.1109/ICSC50631.2021.00017","year":"2021","title":"SYNTHG: Mimicking RDF Graphs Using Tensor Factorization","status":"public","author":[{"full_name":"Amer Desouki, Abdelmoneim","last_name":"Amer Desouki","first_name":"Abdelmoneim"},{"full_name":"Conrads, Felix","last_name":"Conrads","first_name":"Felix"},{"full_name":"Röder, Michael","first_name":"Michael","last_name":"Röder"},{"id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"date_updated":"2022-01-06T06:56:33Z"},{"citation":{"mla":"Demir, Caglar, et al. “A Shallow Neural Model for Relation Prediction.” <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, {IEEE}, 2021, pp. 179–82, doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00038\">10.1109/ICSC50631.2021.00038</a>.","apa":"Demir, C., Moussallem, D., &#38; Ngonga Ngomo, A.-C. (2021). A shallow neural model for relation prediction. <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 179–182. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00038\">https://doi.org/10.1109/ICSC50631.2021.00038</a>","ieee":"C. Demir, D. Moussallem, and A.-C. Ngonga Ngomo, “A shallow neural model for relation prediction,” in <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 2021, pp. 179–182, doi: <a href=\"https://doi.org/10.1109/ICSC50631.2021.00038\">10.1109/ICSC50631.2021.00038</a>.","chicago":"Demir, Caglar, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. “A Shallow Neural Model for Relation Prediction.” In <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 179–82. {IEEE}, 2021. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00038\">https://doi.org/10.1109/ICSC50631.2021.00038</a>.","ama":"Demir C, Moussallem D, Ngonga Ngomo A-C. A shallow neural model for relation prediction. In: <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>. {IEEE}; 2021:179-182. doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00038\">10.1109/ICSC50631.2021.00038</a>","short":"C. Demir, D. Moussallem, A.-C. Ngonga Ngomo, in: 15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021, {IEEE}, 2021, pp. 179–182.","bibtex":"@inproceedings{Demir_Moussallem_Ngonga Ngomo_2021, title={A shallow neural model for relation prediction}, DOI={<a href=\"https://doi.org/10.1109/ICSC50631.2021.00038\">10.1109/ICSC50631.2021.00038</a>}, booktitle={15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}, publisher={{IEEE}}, author={Demir, Caglar and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2021}, pages={179–182} }"},"publication":"15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021","date_created":"2021-09-20T13:15:47Z","department":[{"_id":"574"}],"type":"conference","author":[{"first_name":"Caglar","last_name":"Demir","full_name":"Demir, Caglar"},{"full_name":"Moussallem, Diego","first_name":"Diego","last_name":"Moussallem"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"title":"A shallow neural model for relation prediction","status":"public","year":"2021","date_updated":"2022-01-06T06:56:33Z","language":[{"iso":"eng"}],"_id":"24728","publisher":"{IEEE}","page":"179-182","user_id":"65716","doi":"10.1109/ICSC50631.2021.00038"},{"doi":"10.1109/ICSC50631.2021.00041","user_id":"65716","page":"195-198","_id":"24729","language":[{"iso":"eng"}],"publisher":"{IEEE}","date_updated":"2022-01-06T06:56:33Z","year":"2021","status":"public","title":"Template-based Question Answering using Recursive Neural Networks","author":[{"full_name":"G. Athreya, Ram","last_name":"G. Athreya","first_name":"Ram"},{"full_name":"Kona Bansal, Srividya","last_name":"Kona Bansal","first_name":"Srividya"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716"},{"full_name":"Usbeck, Ricardo","first_name":"Ricardo","last_name":"Usbeck"}],"type":"conference","department":[{"_id":"574"}],"date_created":"2021-09-20T13:16:34Z","publication":"15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021","citation":{"bibtex":"@inproceedings{G. Athreya_Kona Bansal_Ngonga Ngomo_Usbeck_2021, title={Template-based Question Answering using Recursive Neural Networks}, DOI={<a href=\"https://doi.org/10.1109/ICSC50631.2021.00041\">10.1109/ICSC50631.2021.00041</a>}, booktitle={15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}, publisher={{IEEE}}, author={G. Athreya, Ram and Kona Bansal, Srividya and Ngonga Ngomo, Axel-Cyrille and Usbeck, Ricardo}, year={2021}, pages={195–198} }","ama":"G. Athreya R, Kona Bansal S, Ngonga Ngomo A-C, Usbeck R. Template-based Question Answering using Recursive Neural Networks. In: <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>. {IEEE}; 2021:195-198. doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00041\">10.1109/ICSC50631.2021.00041</a>","mla":"G. Athreya, Ram, et al. “Template-Based Question Answering Using Recursive Neural Networks.” <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, {IEEE}, 2021, pp. 195–98, doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00041\">10.1109/ICSC50631.2021.00041</a>.","short":"R. G. Athreya, S. Kona Bansal, A.-C. Ngonga Ngomo, R. Usbeck, in: 15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021, {IEEE}, 2021, pp. 195–198.","chicago":"G. Athreya, Ram, Srividya Kona Bansal, Axel-Cyrille Ngonga Ngomo, and Ricardo Usbeck. “Template-Based Question Answering Using Recursive Neural Networks.” In <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 195–98. {IEEE}, 2021. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00041\">https://doi.org/10.1109/ICSC50631.2021.00041</a>.","ieee":"R. G. Athreya, S. Kona Bansal, A.-C. Ngonga Ngomo, and R. Usbeck, “Template-based Question Answering using Recursive Neural Networks,” in <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 2021, pp. 195–198, doi: <a href=\"https://doi.org/10.1109/ICSC50631.2021.00041\">10.1109/ICSC50631.2021.00041</a>.","apa":"G. Athreya, R., Kona Bansal, S., Ngonga Ngomo, A.-C., &#38; Usbeck, R. (2021). Template-based Question Answering using Recursive Neural Networks. <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 195–198. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00041\">https://doi.org/10.1109/ICSC50631.2021.00041</a>"}},{"date_created":"2021-09-20T13:17:49Z","type":"conference","department":[{"_id":"574"}],"publication":"15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021","citation":{"chicago":"Jalota, Rricha, Daniel Vollmers, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. “LAUREN - Knowledge Graph Summarization for Question Answering.” In <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 221–26. {IEEE}, 2021. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00047\">https://doi.org/10.1109/ICSC50631.2021.00047</a>.","short":"R. Jalota, D. Vollmers, D. Moussallem, A.-C. Ngonga Ngomo, in: 15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021, {IEEE}, 2021, pp. 221–226.","apa":"Jalota, R., Vollmers, D., Moussallem, D., &#38; Ngonga Ngomo, A.-C. (2021). LAUREN - Knowledge Graph Summarization for Question Answering. <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 221–226. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00047\">https://doi.org/10.1109/ICSC50631.2021.00047</a>","ieee":"R. Jalota, D. Vollmers, D. Moussallem, and A.-C. Ngonga Ngomo, “LAUREN - Knowledge Graph Summarization for Question Answering,” in <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 2021, pp. 221–226, doi: <a href=\"https://doi.org/10.1109/ICSC50631.2021.00047\">10.1109/ICSC50631.2021.00047</a>.","ama":"Jalota R, Vollmers D, Moussallem D, Ngonga Ngomo A-C. LAUREN - Knowledge Graph Summarization for Question Answering. In: <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>. {IEEE}; 2021:221-226. doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00047\">10.1109/ICSC50631.2021.00047</a>","bibtex":"@inproceedings{Jalota_Vollmers_Moussallem_Ngonga Ngomo_2021, title={LAUREN - Knowledge Graph Summarization for Question Answering}, DOI={<a href=\"https://doi.org/10.1109/ICSC50631.2021.00047\">10.1109/ICSC50631.2021.00047</a>}, booktitle={15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}, publisher={{IEEE}}, author={Jalota, Rricha and Vollmers, Daniel and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}, year={2021}, pages={221–226} }","mla":"Jalota, Rricha, et al. “LAUREN - Knowledge Graph Summarization for Question Answering.” <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, {IEEE}, 2021, pp. 221–26, doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00047\">10.1109/ICSC50631.2021.00047</a>."},"page":"221-226","language":[{"iso":"eng"}],"_id":"24730","publisher":"{IEEE}","doi":"10.1109/ICSC50631.2021.00047","user_id":"65716","status":"public","title":"LAUREN - Knowledge Graph Summarization for Question Answering","year":"2021","author":[{"last_name":"Jalota","first_name":"Rricha","full_name":"Jalota, Rricha"},{"full_name":"Vollmers, Daniel","first_name":"Daniel","last_name":"Vollmers"},{"full_name":"Moussallem, Diego","first_name":"Diego","last_name":"Moussallem"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille","id":"65716"}],"date_updated":"2022-01-06T06:56:33Z"},{"publication":"15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021","citation":{"bibtex":"@inproceedings{Wilke_Bannoura_Ngonga Ngomo_2021, title={Relicensing Combined Datasets}, DOI={<a href=\"https://doi.org/10.1109/ICSC50631.2021.00050\">10.1109/ICSC50631.2021.00050</a>}, booktitle={15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}, publisher={{IEEE}}, author={Wilke, Adrian and Bannoura, Arwa and Ngonga Ngomo, Axel-Cyrille}, year={2021}, pages={241–247} }","ama":"Wilke A, Bannoura A, Ngonga Ngomo A-C. Relicensing Combined Datasets. In: <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>. {IEEE}; 2021:241-247. doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00050\">10.1109/ICSC50631.2021.00050</a>","mla":"Wilke, Adrian, et al. “Relicensing Combined Datasets.” <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, {IEEE}, 2021, pp. 241–47, doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00050\">10.1109/ICSC50631.2021.00050</a>.","short":"A. Wilke, A. Bannoura, A.-C. Ngonga Ngomo, in: 15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021, {IEEE}, 2021, pp. 241–247.","chicago":"Wilke, Adrian, Arwa Bannoura, and Axel-Cyrille Ngonga Ngomo. “Relicensing Combined Datasets.” In <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 241–47. {IEEE}, 2021. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00050\">https://doi.org/10.1109/ICSC50631.2021.00050</a>.","ieee":"A. Wilke, A. Bannoura, and A.-C. Ngonga Ngomo, “Relicensing Combined Datasets,” in <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 2021, pp. 241–247, doi: <a href=\"https://doi.org/10.1109/ICSC50631.2021.00050\">10.1109/ICSC50631.2021.00050</a>.","apa":"Wilke, A., Bannoura, A., &#38; Ngonga Ngomo, A.-C. (2021). Relicensing Combined Datasets. <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 241–247. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00050\">https://doi.org/10.1109/ICSC50631.2021.00050</a>"},"type":"conference","department":[{"_id":"574"}],"date_created":"2021-09-20T13:18:37Z","date_updated":"2022-01-06T06:56:33Z","title":"Relicensing Combined Datasets","year":"2021","status":"public","author":[{"full_name":"Wilke, Adrian","last_name":"Wilke","first_name":"Adrian"},{"last_name":"Bannoura","first_name":"Arwa","full_name":"Bannoura, Arwa"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716"}],"doi":"10.1109/ICSC50631.2021.00050","user_id":"65716","page":"241-247","language":[{"iso":"eng"}],"_id":"24731","publisher":"{IEEE}"},{"user_id":"65716","doi":"10.1109/ICSC50631.2021.00054","page":"272-279","publisher":"{IEEE}","_id":"24732","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:56:33Z","title":"ORCA - a Benchmark for Data Web Crawlers","status":"public","year":"2021","author":[{"full_name":"Röder, Michael","first_name":"Michael","last_name":"Röder"},{"full_name":"de Souza, Geraldo","last_name":"de Souza","first_name":"Geraldo"},{"full_name":"Kuchelev, Denis","first_name":"Denis","last_name":"Kuchelev"},{"full_name":"Amer Desouki, Abdelmoneim","first_name":"Abdelmoneim","last_name":"Amer Desouki"},{"last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"type":"conference","department":[{"_id":"574"}],"date_created":"2021-09-20T13:19:11Z","publication":"15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021","citation":{"chicago":"Röder, Michael, Geraldo de Souza, Denis Kuchelev, Abdelmoneim Amer Desouki, and Axel-Cyrille Ngonga Ngomo. “ORCA - a Benchmark for Data Web Crawlers.” In <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 272–79. {IEEE}, 2021. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00054\">https://doi.org/10.1109/ICSC50631.2021.00054</a>.","short":"M. Röder, G. de Souza, D. Kuchelev, A. Amer Desouki, A.-C. Ngonga Ngomo, in: 15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021, {IEEE}, 2021, pp. 272–279.","ieee":"M. Röder, G. de Souza, D. Kuchelev, A. Amer Desouki, and A.-C. Ngonga Ngomo, “ORCA - a Benchmark for Data Web Crawlers,” in <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 2021, pp. 272–279, doi: <a href=\"https://doi.org/10.1109/ICSC50631.2021.00054\">10.1109/ICSC50631.2021.00054</a>.","apa":"Röder, M., de Souza, G., Kuchelev, D., Amer Desouki, A., &#38; Ngonga Ngomo, A.-C. (2021). ORCA - a Benchmark for Data Web Crawlers. <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, 272–279. <a href=\"https://doi.org/10.1109/ICSC50631.2021.00054\">https://doi.org/10.1109/ICSC50631.2021.00054</a>","bibtex":"@inproceedings{Röder_de Souza_Kuchelev_Amer Desouki_Ngonga Ngomo_2021, title={ORCA - a Benchmark for Data Web Crawlers}, DOI={<a href=\"https://doi.org/10.1109/ICSC50631.2021.00054\">10.1109/ICSC50631.2021.00054</a>}, booktitle={15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021}, publisher={{IEEE}}, author={Röder, Michael and de Souza, Geraldo and Kuchelev, Denis and Amer Desouki, Abdelmoneim and Ngonga Ngomo, Axel-Cyrille}, year={2021}, pages={272–279} }","ama":"Röder M, de Souza G, Kuchelev D, Amer Desouki A, Ngonga Ngomo A-C. ORCA - a Benchmark for Data Web Crawlers. In: <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>. {IEEE}; 2021:272-279. doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00054\">10.1109/ICSC50631.2021.00054</a>","mla":"Röder, Michael, et al. “ORCA - a Benchmark for Data Web Crawlers.” <i>15th {IEEE} International Conference on Semantic Computing, {ICSC} 2021, Laguna Hills, CA, USA, January 27-29, 2021</i>, {IEEE}, 2021, pp. 272–79, doi:<a href=\"https://doi.org/10.1109/ICSC50631.2021.00054\">10.1109/ICSC50631.2021.00054</a>."}},{"doi":"10.17619/UNIPB/1-1169 ","user_id":"15504","language":[{"iso":"eng"}],"_id":"24887","date_updated":"2022-01-06T06:56:40Z","title":"Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter","year":"2021","status":"public","author":[{"full_name":"Hinnenthal, Kristian","first_name":"Kristian","last_name":"Hinnenthal","id":"32229"}],"type":"dissertation","department":[{"_id":"79"}],"date_created":"2021-09-22T12:33:44Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"ama":"Hinnenthal K. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>.; 2021. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">10.17619/UNIPB/1-1169 </a>","bibtex":"@book{Hinnenthal_2021, title={Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">10.17619/UNIPB/1-1169 </a>}, author={Hinnenthal, Kristian}, year={2021} }","mla":"Hinnenthal, Kristian. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. 2021, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">10.17619/UNIPB/1-1169 </a>.","short":"K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021.","chicago":"Hinnenthal, Kristian. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">https://doi.org/10.17619/UNIPB/1-1169 </a>.","apa":"Hinnenthal, K. (2021). <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1169 \">https://doi.org/10.17619/UNIPB/1-1169 </a>","ieee":"K. Hinnenthal, <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter</i>. 2021."}},{"abstract":[{"text":"Motivated by the prospect of computing agents that explore unknown environments and construct convex hulls on the nanoscale, we investigate the capabilities and limitations of a single deterministic finite automaton robot in the three-dimensional hybrid model for programmable matter. In this model, active robots move on a set of passive tiles, called configuration, with the geometric shape of rhombic dodecahedra on the adjacency graph of the face-centered cubic sphere-packing. We show that the exploration problem is equally hard in the hybrid model and in three-dimensional mazes, in which tiles have the shape of cubes and are positioned at the vertices of $\\mathbb{Z}^3$. Thereby, a single robot with a constant number of pebbles cannot solve this problem in the hybrid model on arbitrary configurations. We provide algorithms for a robot with two pebbles that solve the exploration problem in the subclass of compact configurations of size $n$ in $\\O(n^3)$ rounds. Further, we investigate the robot's capabilities of detection and hull construction in terms of restricted orientation convexity. We show that a robot without any pebble can detect strong $\\O$-convexity in $\\O(n)$ rounds, but cannot detect weak $\\O$-convexity, not even if provided with a single pebble. Assuming that a robot can construct tiles from scratch and deconstruct previously constructed tiles, we show that the strong $\\O$-hull of any given configuration of size $n$ can be constructed in $\\O(n^4)$ rounds, even if the robot cannot distinguish constructed from native tiles.","lang":"eng"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"citation":{"short":"D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.","chicago":"Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>, 2021.","ieee":"D. J. Liedtke, <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021.","apa":"Liedtke, D. J. (2021). <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.","bibtex":"@book{Liedtke_2021, title={Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}, author={Liedtke, David Jan}, year={2021} }","ama":"Liedtke DJ. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>.; 2021.","mla":"Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model</i>. 2021."},"file_date_updated":"2021-09-29T12:34:47Z","department":[{"_id":"79"}],"type":"mastersthesis","keyword":["Robot Exploration","Finite Automaton","Hybrid Model for Programmable Matter","Convex Hull"],"date_created":"2021-09-29T12:37:39Z","file":[{"access_level":"local","file_size":10114825,"file_name":"Master - Thesis.pdf","date_updated":"2021-09-29T12:34:47Z","relation":"main_file","content_type":"application/pdf","file_id":"25128","creator":"liedtke","date_created":"2021-09-29T12:34:47Z"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:56:53Z","author":[{"last_name":"Liedtke","first_name":"David Jan","full_name":"Liedtke, David Jan","id":"55557"}],"title":"Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model","year":"2021","status":"public","ddc":["000"],"user_id":"55557","language":[{"iso":"eng"}],"_id":"25126"}]