2020
Ralf Möller Marisa Mohr,
On the Behaviour of Permutation Entropy on Fractional Brownian Motion in a Multivariate Setting, in Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference 2020 (APSIPA-ASC) , 2020.
On the Behaviour of Permutation Entropy on Fractional Brownian Motion in a Multivariate Setting, in Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference 2020 (APSIPA-ASC) , 2020.
Mena
Leemhuis,
Özgür L.
Özçep, and
Diedrich
Wolter,
Orthologics for Cones, arXiv e-prints , pp. arXiv:2008.03172, 2020.
Orthologics for Cones, arXiv e-prints , pp. arXiv:2008.03172, 2020.
Tobias
Groth,
Sven
Groppe,
Martin
Koppehel, and
Thilo
Pionteck,
Parallelizing Approximate Search on Adaptive Radix Trees, in Proceedings of the 28th Italian Symposium on Advanced Database Systems, Villasimius, Sud Sardegna, Italy (virtual due to Covid-19 pandemic) , 2020. pp. 56--67.
Parallelizing Approximate Search on Adaptive Radix Trees, in Proceedings of the 28th Italian Symposium on Advanced Database Systems, Villasimius, Sud Sardegna, Italy (virtual due to Covid-19 pandemic) , 2020. pp. 56--67.
Datei: | |
Bibtex: | ![]() @inproceedings{GrothGKP20, author = {Tobias Groth and Sven Groppe and Martin Koppehel and Thilo Pionteck}, title = {Parallelizing Approximate Search on Adaptive Radix Trees}, booktitle = {Proceedings of the 28th Italian Symposium on Advanced Database Systems, Villasimius, Sud Sardegna, Italy (virtual due to Covid-19 pandemic)}, pages = {56--67}, year = {2020}, url = {http://ceur-ws.org/Vol-2646/16-paper.pdf} } |
Sven
Groppe,
Le
Gruenwald, and
Valentina
Presutti,
Proceedings of the International Workshop on Semantic Big Data (SBD) in conjunction with SIGMOD, Portland, Oregon, USA., .... ACM, 2020.
Proceedings of the International Workshop on Semantic Big Data (SBD) in conjunction with SIGMOD, Portland, Oregon, USA., .... ACM, 2020.
DOI: | 10.1145/3391274 |
ISBN: | 978-1-4503-7974-8 |
Datei: | 3391274 |
Sven
Groppe, and
Lina
Hartung,
ReViz: A Tool for Automatically Generating Citation Graphs and Variants, in International Conference on Asian Digital Libraries (ICADL): Digital Libraries at Times of Massive Societal Transition , 2020. pp. 107--121.
ReViz: A Tool for Automatically Generating Citation Graphs and Variants, in International Conference on Asian Digital Libraries (ICADL): Digital Libraries at Times of Massive Societal Transition , 2020. pp. 107--121.
Datei: | 978-3-030-64452-9_10 |
Felix
Kuhr, and
Özgür Lütfü
Özçep,
Theory Interpretations for Topic Models, in Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference {(FLAIRS-20)} , 2020.
Theory Interpretations for Topic Models, in Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference {(FLAIRS-20)} , 2020.
DOI: | https://aaai.org/ocs/index.php/FLAIRS/FLAIRS20/paper/view/18412 |
Bibtex: | ![]() @inproceedings{KuhOe20c, Author = {Felix Kuhr and Özgür Lütfü Özcep}, Booktitle = {Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference {(FLAIRS-20)}}, Title = {Theory Interpretations for Topic Models}, Year = {2020} } |
Diedrich
Wolter, and
Özgür Lütfü
Özçep,
Wissen über Raum und Zeit, in Handbuch der K{\"u}nstlichen Intelligenz , De Gruyter, 2020.
Wissen über Raum und Zeit, in Handbuch der K{\"u}nstlichen Intelligenz , De Gruyter, 2020.
Mattis
Hartwig, and
Ralf
Möller,
How to Encode Dynamic Gaussian Bayesian Networks as Gaussian Processes?, in {AI} 2020: Advances in Artificial Intelligence - 33rd Australasian Joint Conference, {AI} 2020 , 2020.
How to Encode Dynamic Gaussian Bayesian Networks as Gaussian Processes?, in {AI} 2020: Advances in Artificial Intelligence - 33rd Australasian Joint Conference, {AI} 2020 , 2020.
Karsten Keller Marisa Mohr,
New Approaches in Ordinal Pattern Representations for Multivariate Time Series, in Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference (FLAIRS-33) , North Miami Beach, Florida, USA, May 17-20, 2020: {AAAI} Press, 2020. pp. 124--129.
New Approaches in Ordinal Pattern Representations for Multivariate Time Series, in Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference (FLAIRS-33) , North Miami Beach, Florida, USA, May 17-20, 2020: {AAAI} Press, 2020. pp. 124--129.
DOI: | https://www.aaai.org/ocs/index.php/FLAIRS/FLAIRS20/paper/view/18417/17531 |
Bibtex: | ![]() @inproceedings{MohWilHarMoKe20, Author = {Marisa Mohr, Florian Wilhelm, Mattis Hartwig, Ralf M{\"o}ller, Karsten Keller}, booktitle = {Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference (FLAIRS-33)}, year = {2020}, Title = {New Approaches in Ordinal Pattern Representations for Multivariate Time Series}, doi = {https://www.aaai.org/ocs/index.php/FLAIRS/FLAIRS20/paper/view/18417/17531} } |
Tim
Bittner, and
Sven
Groppe,
Hardware Accelerating the Optimization of Transaction Schedules via Quantum Annealing by Avoiding Blocking, Open Journal of Cloud Computing (OJCC) , vol. 7, no. 1, pp. 1--21, 2020.
Hardware Accelerating the Optimization of Transaction Schedules via Quantum Annealing by Avoiding Blocking, Open Journal of Cloud Computing (OJCC) , vol. 7, no. 1, pp. 1--21, 2020.
Datei: | urn:nbn:de:101:1-2020112218332015343957 |
Bibtex: | ![]() @Article{OJCC_2020v7i1n01_Bittner, title = {Hardware Accelerating the Optimization of Transaction Schedules via Quantum Annealing by Avoiding Blocking}, author = {Tim Bittner and Sven Groppe}, journal = {Open Journal of Cloud Computing (OJCC)}, issn = {2199-1987}, year = {2020}, volume = {7}, number = {1}, pages = {1--21}, url = {http://nbn-resolving.de/urn:nbn:de:101:1-2020112218332015343957} } |
Simon
Schiff,
Felix
Kuhr,
Sylvia
Melzer, and
Ralf
Möller,
AI-based Companion Services for Humanities, in AI methods for digital heritage, Workshop at 43rd German Conference on Artificial Intelligence , 2020.
AI-based Companion Services for Humanities, in AI methods for digital heritage, Workshop at 43rd German Conference on Artificial Intelligence , 2020.
[English]
Gerhard Satzger Lucas Baier,
Handling Concept Drifts in Regression Problems – the Error Intersection Approach, in Proceedings of 15th International Conference on Wirtschaftsinformatik, 2020, Potsdam, Germany , N. Gronau, M. Heine, H. Krasnova, K. Poustcchi, Eds. {GITO} Verlag, 2020.
Handling Concept Drifts in Regression Problems – the Error Intersection Approach, in Proceedings of 15th International Conference on Wirtschaftsinformatik, 2020, Potsdam, Germany , N. Gronau, M. Heine, H. Krasnova, K. Poustcchi, Eds. {GITO} Verlag, 2020.
DOI: | https://publikationen.bibliothek.kit.edu/1000105012 |
Datei: | |
Bibtex: | ![]() @inproceedings{BaierHofmannKuehlMohrSatzger2020, title = {Handling Concept Drifts in Regression Problems – the Error Intersection Approach}, language = {English}, booktitle = {Proceedings of 15th International Conference on Wirtschaftsinformatik, 2020, Potsdam, Germany}, author = {Lucas Baier, Marcel Hofmann, Niklas Kühl, Marisa Mohr, Gerhard Satzger}, year = {2020}, doi = {https://publikationen.bibliothek.kit.edu/1000105012} } |
Tristan
Potten, and
Tanya
Braun,
{Benchmarking Inference Algorithms for Probabilistic Relational Models}, in ICCS-20 Proceedings of the 25th International Conference on Conceptual Structures , 2020.
{Benchmarking Inference Algorithms for Probabilistic Relational Models}, in ICCS-20 Proceedings of the 25th International Conference on Conceptual Structures , 2020.
DOI: | https://doi.org/10.1007/978-3-030-57855-8_15 |
Bibtex: | ![]() @inproceedings{PotBr20, author = {Tristan Potten and Tanya Braun}, title = {{Benchmarking Inference Algorithms for Probabilistic Relational Models}}, booktitle = {ICCS-20 Proceedings of the 25th International Conference on Conceptual Structures}, year = {2020}, doi = {https://doi.org/10.1007/978-3-030-57855-8_15} } |
Peter Poensgen,
{Branch-and-Bound Ranked Search by Minimizing Parabolic Polynomials}, Open J. Databases , vol. 7, no. 1, pp. 12--20, 2020.
{Branch-and-Bound Ranked Search by Minimizing Parabolic Polynomials}, Open J. Databases , vol. 7, no. 1, pp. 12--20, 2020.
Datei: | OJDB_2020v7i1n02_Poensgen.html |
Bibtex: | ![]() @article{PoensgenM20a, author = {Peter Poensgen and Ralf M{\"{o}}ller}, title = {{Branch-and-Bound Ranked Search by Minimizing Parabolic Polynomials}}, journal = {Open J. Databases}, volume = {7}, number = {1}, pages = {12--20}, year = {2020}, url = {https://www.ronpub.com/ojdb/OJDB_2020v7i1n02_Poensgen.html} } |
Mattis Hartwig,
"{Efficient Query Answering in Nonparametric Probabilistic Graphical Models}" Bamberg, 2020.
"{Efficient Query Answering in Nonparametric Probabilistic Graphical Models}" Bamberg, 2020.
G"unther
G"orz,
Tanya
Braun, and
Ute Schmid
(Eds.),
{Handbuch der Künstlichen Intelligenz, 6. Auflage}., .... De Gruyter, 2020.
{Handbuch der Künstlichen Intelligenz, 6. Auflage}., .... De Gruyter, 2020.
Bibtex: | ![]() @book{GoeBrSc20, author = "G\"unther G\"orz and Tanya Braun and Ute Schmid (Eds.)", title = "{Handbuch der Künstlichen Intelligenz, 6. Auflage}", year = "2020", publisher = "De Gruyter" } |
Ralf Möller Marisa Mohr,
{On the Behaviour of Permutation Entropy on Fractional Brownian Motion in a Multivariate Setting}, in Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference 2020 (APSIPA-ASC) , IEEE, 2020. pp. 189--196.
{On the Behaviour of Permutation Entropy on Fractional Brownian Motion in a Multivariate Setting}, in Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference 2020 (APSIPA-ASC) , IEEE, 2020. pp. 189--196.
DOI: | https://ieeexplore.ieee.org/document/9306466 |
Bibtex: | ![]() @inproceedings{MohFiMo, author = {Marisa Mohr, Nils Finke, Ralf M{\"o}ller}, title = {{On the Behaviour of Permutation Entropy on Fractional Brownian Motion in a Multivariate Setting}}, booktitle = {Proceedings of the Asia-Pacific Signal and Information Processing Association Annual Summit and Conference 2020 (APSIPA-ASC)}, year = {2020}, pages = {189--196}, publisher = {IEEE}, doi = {https://ieeexplore.ieee.org/document/9306466} } |
Marisa
Mohr,
Florian
Wilhelm, and
Ralf
Möller,
"{On the Behaviour of Weighted Permutation Entropy on Fractional Brownian Motion - Extended}" 2020.
"{On the Behaviour of Weighted Permutation Entropy on Fractional Brownian Motion - Extended}" 2020.
Peter
Poensgen, and
Ralf
Möller,
{Quasi-Convex Scoring Functions in Branch-and-Bound Ranked Search}, Open Journal of Databases (OJDB) , vol. 7, no. 1, pp. 1--11, 2020. RonPub.
{Quasi-Convex Scoring Functions in Branch-and-Bound Ranked Search}, Open Journal of Databases (OJDB) , vol. 7, no. 1, pp. 1--11, 2020. RonPub.
Datei: | OJDB_2020v7i1n01_Poensgen.html |
Bibtex: | ![]() @Article{OJDB_2020v7i1n01_Poensgen, author = {Peter Poensgen and Ralf M{\"o}ller}, title = {{Quasi-Convex Scoring Functions in Branch-and-Bound Ranked Search}}, journal = {Open Journal of Databases (OJDB)}, issn = {2199-3459}, year = {2020}, volume = {7}, number = {1}, pages = {1--11}, url = {https://www.ronpub.com/ojdb/OJDB_2020v7i1n01_Poensgen.html}, publisher = {RonPub}, abstract = {For answering top-k queries in which attributes are aggregated to a scalar value for defining a ranking, usually the well-known branch-and-bound principle can be used for efficient query answering. Standard algorithms (e.g., Branch-and-Bound Ranked Search, BRS for short) require scoring functions to be monotone, such that a top-k ranking can be computed in sublinear time in the average case. If monotonicity cannot be guaranteed, efficient query answering algorithms are not known. To make branch-and-bound effective with descending or ascending rankings (maximum top-k or minimum top-k queries, respectively), BRS must be able to identify bounds for exploring search partitions, and only for monotonic ranking functions this is trivial. In this paper, we investigate the class of quasi-convex functions used for scoring objects, and we examine how bounds for exploring data partitions can correctly and efficiently be computed for quasi-convex functions in BRS for maximum top-k queries. Given that quasi-convex scoring functions can usefully be employed for ranking objects in a variety of applications, the mathematical findings presented in this paper are indeed significant for practical top-k query answering.} } |
Tanya Braun,
{Rescued from a Sea of Queries: Exact Inference in Probabilistic Relational Models}, University of L"ubeck, 2020.
{Rescued from a Sea of Queries: Exact Inference in Probabilistic Relational Models}, University of L"ubeck, 2020.
G"unther
G"orz,
Tanya
Braun, and
Ute Schmid
(Eds.),
{Handbuch der K"unstlichen Intelligenz, 6. Auflage}., .... De Gruyter, 2020.
{Handbuch der K"unstlichen Intelligenz, 6. Auflage}., .... De Gruyter, 2020.
Datei: | 558044 |
Bibtex: | ![]() @book{GoeBrSc20, author = "G\"unther G\"orz and Tanya Braun and Ute Schmid (Eds.)", title = "{Handbuch der K\"unstlichen Intelligenz, 6. Auflage}", year = "2020", publisher = "De Gruyter", url = {https://www.degruyter.com/view/title/558044?rskey=Yc1Ty5} } |
Simon
Schiff,
Felix
Kuhr,
Sylvia
Melzer, and
Ralf
Möller,
AI-based Companion Services for Humanities, 2020.
AI-based Companion Services for Humanities, 2020.
Felix
Kuhr,
Magnus
Bender,
Tanya
Braun, and
Ralf
Möller,
Augmenting and Automating Corpus Enrichment, Int. J. Semantic Computing , vol. 14, no. 2, pp. 173--197, 2020.
Augmenting and Automating Corpus Enrichment, Int. J. Semantic Computing , vol. 14, no. 2, pp. 173--197, 2020.
DOI: | 10.1142/S1793351X20400061 |
Datei: | |
Bibtex: | ![]() @article{KuhBeBrMo20c, author={Felix Kuhr and Magnus Bender and Tanya Braun and Ralf M\"oller}, title={Augmenting and Automating Corpus Enrichment}, journal={Int. J. Semantic Computing}, volume={14}, number={2}, pages= {173--197}, year={2020}, doi = {https://dx.doi.org/10.1142/S1793351X20400061} } |
Tim
Bittner, and
Sven
Groppe,
Avoiding Blocking by Scheduling Transactions Using Quantum Annealing, in Proceedings of the 24th Symposium on International Database Engineering \& Applications (IDEAS), Seoul, Republic of Korea (virtual due to Covid-19 pandemic) , New York, NY, USA: Association for Computing Machinery (ACM), 2020.
Avoiding Blocking by Scheduling Transactions Using Quantum Annealing, in Proceedings of the 24th Symposium on International Database Engineering \& Applications (IDEAS), Seoul, Republic of Korea (virtual due to Covid-19 pandemic) , New York, NY, USA: Association for Computing Machinery (ACM), 2020.
DOI: | 10.1145/3410566.3410593 |
ISBN: | 9781450375030 |
Datei: | 3410566.3410593 |
Bibtex: | ![]() @inproceedings{Bittner20TransactionScheduleQuantumAnnealing, author = {Tim Bittner and Sven Groppe}, title = {Avoiding Blocking by Scheduling Transactions Using Quantum Annealing}, year = {2020}, isbn = {9781450375030}, publisher = {Association for Computing Machinery (ACM)}, address = {New York, NY, USA}, url = {https://doi.org/10.1145/3410566.3410593}, booktitle = {Proceedings of the 24th Symposium on International Database Engineering \& Applications (IDEAS), Seoul, Republic of Korea (virtual due to Covid-19 pandemic)} } |
Simon
Schiff, and
Özgür Lütfü
Özçep,
Bounded-Memory Criteria for Streams with Application Time, in Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference {(FLAIRS-20)} , North Miami Beach, Florida, USA: {AAAI} Press, 2020. pp. 148--153.
Bounded-Memory Criteria for Streams with Application Time, in Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference {(FLAIRS-20)} , North Miami Beach, Florida, USA: {AAAI} Press, 2020. pp. 148--153.
Datei: | 18421 |
Bibtex: | ![]() @inproceedings{SchOe20a, Author = {Simon Schiff and Özgür Lütfü Özçep}, Booktitle = {Proceedings of the 33rd International Florida Artificial Intelligence Research Society Conference {(FLAIRS-20)}}, Title = {Bounded-Memory Criteria for Streams with Application Time}, Year = {2020} } |