[{"language":[{"iso":"eng"}],"citation":{"ieee":"R. Feldhans et al., “Drift Detection in Text Data with Document Embeddings,” in Intelligent Data Engineering and Automated Learning – IDEAL 2021, Cham, 2021.","short":"R. Feldhans, A. Wilke, S. Heindorf, M.H. Shaker, B. Hammer, A.-C. Ngonga Ngomo, E. Hüllermeier, in: Intelligent Data Engineering and Automated Learning – IDEAL 2021, Cham, 2021.","bibtex":"@inbook{Feldhans_Wilke_Heindorf_Shaker_Hammer_Ngonga Ngomo_Hüllermeier_2021, place={Cham}, title={Drift Detection in Text Data with Document Embeddings}, DOI={10.1007/978-3-030-91608-4_11}, booktitle={Intelligent Data Engineering and Automated Learning – IDEAL 2021}, author={Feldhans, Robert and Wilke, Adrian and Heindorf, Stefan and Shaker, Mohammad Hossein and Hammer, Barbara and Ngonga Ngomo, Axel-Cyrille and Hüllermeier, Eyke}, year={2021} }","mla":"Feldhans, Robert, et al. “Drift Detection in Text Data with Document Embeddings.” Intelligent Data Engineering and Automated Learning – IDEAL 2021, 2021, doi:10.1007/978-3-030-91608-4_11.","chicago":"Feldhans, Robert, Adrian Wilke, Stefan Heindorf, Mohammad Hossein Shaker, Barbara Hammer, Axel-Cyrille Ngonga Ngomo, and Eyke Hüllermeier. “Drift Detection in Text Data with Document Embeddings.” In Intelligent Data Engineering and Automated Learning – IDEAL 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-91608-4_11.","apa":"Feldhans, R., Wilke, A., Heindorf, S., Shaker, M. H., Hammer, B., Ngonga Ngomo, A.-C., & Hüllermeier, E. (2021). Drift Detection in Text Data with Document Embeddings. In Intelligent Data Engineering and Automated Learning – IDEAL 2021. https://doi.org/10.1007/978-3-030-91608-4_11","ama":"Feldhans R, Wilke A, Heindorf S, et al. Drift Detection in Text Data with Document Embeddings. In: Intelligent Data Engineering and Automated Learning – IDEAL 2021. ; 2021. doi:10.1007/978-3-030-91608-4_11"},"type":"book_chapter","year":"2021","_id":"29046","date_updated":"2022-01-06T06:58:44Z","doi":"10.1007/978-3-030-91608-4_11","department":[{"_id":"574"}],"publication":"Intelligent Data Engineering and Automated Learning – IDEAL 2021","author":[{"last_name":"Feldhans","full_name":"Feldhans, Robert","first_name":"Robert"},{"last_name":"Wilke","first_name":"Adrian","full_name":"Wilke, Adrian"},{"last_name":"Heindorf","first_name":"Stefan","full_name":"Heindorf, Stefan"},{"last_name":"Shaker","full_name":"Shaker, Mohammad Hossein","first_name":"Mohammad Hossein"},{"last_name":"Hammer","first_name":"Barbara","full_name":"Hammer, Barbara"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"}],"date_created":"2021-12-17T10:33:12Z","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030916077","9783030916084"]},"publication_status":"published","place":"Cham","user_id":"9101","title":"Drift Detection in Text Data with Document Embeddings"},{"doi":"10.1007/978-3-030-68780-9_19","date_updated":"2022-01-06T06:54:57Z","_id":"21378","type":"conference","citation":{"ama":"Hartel R, Dunst A. An OCR Pipeline and Semantic Text Analysis for Comics. In: MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges. Cham; 2021. doi:10.1007/978-3-030-68780-9_19","apa":"Hartel, R., & Dunst, A. (2021). An OCR Pipeline and Semantic Text Analysis for Comics. In MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges. Cham. https://doi.org/10.1007/978-3-030-68780-9_19","chicago":"Hartel, Rita, and Alexander Dunst. “An OCR Pipeline and Semantic Text Analysis for Comics.” In MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges. Cham, 2021. https://doi.org/10.1007/978-3-030-68780-9_19.","mla":"Hartel, Rita, and Alexander Dunst. “An OCR Pipeline and Semantic Text Analysis for Comics.” MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges, 2021, doi:10.1007/978-3-030-68780-9_19.","bibtex":"@inproceedings{Hartel_Dunst_2021, place={Cham}, title={An OCR Pipeline and Semantic Text Analysis for Comics}, DOI={10.1007/978-3-030-68780-9_19}, booktitle={MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges}, author={Hartel, Rita and Dunst, Alexander}, year={2021} }","short":"R. Hartel, A. Dunst, in: MANPU 2020: The 4th International Workshop on CoMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges, Cham, 2021.","ieee":"R. Hartel and A. Dunst, “An OCR Pipeline and Semantic Text Analysis for Comics,” in MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges, 2021."},"year":"2021","language":[{"iso":"eng"}],"title":"An OCR Pipeline and Semantic Text Analysis for Comics","user_id":"14961","place":"Cham","publication_status":"published","publication_identifier":{"isbn":["9783030687793","9783030687809"],"issn":["0302-9743","1611-3349"]},"status":"public","date_created":"2021-03-04T12:35:22Z","author":[{"full_name":"Hartel, Rita","first_name":"Rita","id":"14961","last_name":"Hartel"},{"full_name":"Dunst, Alexander","first_name":"Alexander","last_name":"Dunst"}],"publication":"MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges","department":[{"_id":"69"}]},{"_id":"22057","year":"2021","type":"book_chapter","citation":{"mla":"Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75245-3_22.","bibtex":"@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance}, DOI={10.1007/978-3-030-75245-3_22}, booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek, Rafael and Niehues, David}, year={2021} }","chicago":"Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” In Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75245-3_22.","ama":"Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In: Public-Key Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75245-3_22","apa":"Jager, T., Kurek, R., & Niehues, D. (2021). Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75245-3_22","ieee":"T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance,” in Public-Key Cryptography – PKC 2021, Cham, 2021.","short":"T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021."},"user_id":"36113","ddc":["000"],"abstract":[{"text":"We construct more efficient cryptosystems with provable\r\nsecurity against adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient, selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal, Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n– Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption, has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves full adaptive security with\r\npublic parameters of size only O(log λ). The other is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext is\r\nonly a single group element and the security reduction is quadrat-\r\nically tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n– A very efficient adaptively-secure verifiable random function where\r\nproofs, public keys, and secret keys have size O(log λ).\r\nAs a technical contribution we introduce blockwise partitioning, which\r\nleverages the assumption that a cryptographic hash function is weak\r\nnear-collision resistant to prove full adaptive security of cryptosystems.","lang":"eng"}],"has_accepted_license":"1","status":"public","date_created":"2021-05-10T15:56:24Z","file":[{"relation":"main_file","date_updated":"2021-05-10T16:02:02Z","content_type":"application/pdf","file_id":"22058","creator":"davnie","file_size":701068,"access_level":"closed","file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf","date_created":"2021-05-10T16:02:02Z"}],"author":[{"full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"},{"first_name":"Rafael","full_name":"Kurek, Rafael","last_name":"Kurek"},{"full_name":"Niehues, David","first_name":"David","id":"36113","last_name":"Niehues"}],"file_date_updated":"2021-05-10T16:02:02Z","publication":"Public-Key Cryptography – PKC 2021","doi":"10.1007/978-3-030-75245-3_22","date_updated":"2022-01-06T06:55:23Z","language":[{"iso":"eng"}],"title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","place":"Cham","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752446","9783030752453"]},"publication_status":"published","department":[{"_id":"558"}]},{"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-75248-4_3","date_updated":"2022-01-06T06:55:24Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752477","9783030752484"]},"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"558"}],"title":"Verifiable Random Functions with Optimal Tightness","place":"Cham","citation":{"ama":"Niehues D. Verifiable Random Functions with Optimal Tightness. In: Public-Key Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75248-4_3","apa":"Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75248-4_3","chicago":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75248-4_3.","bibtex":"@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions with Optimal Tightness}, DOI={10.1007/978-3-030-75248-4_3}, booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021} }","mla":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75248-4_3.","short":"D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","ieee":"D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in Public-Key Cryptography – PKC 2021, Cham, 2021."},"type":"book_chapter","year":"2021","_id":"22059","status":"public","has_accepted_license":"1","date_created":"2021-05-10T16:07:50Z","author":[{"last_name":"Niehues","id":"36113","first_name":"David","full_name":"Niehues, David"}],"file_date_updated":"2021-05-10T16:09:17Z","publication":"Public-Key Cryptography – PKC 2021","file":[{"access_level":"closed","date_created":"2021-05-10T16:09:17Z","file_name":"Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf","date_updated":"2021-05-10T16:09:17Z","content_type":"application/pdf","relation":"main_file","file_size":697361,"creator":"davnie","file_id":"22060"}],"ddc":["000"],"user_id":"36113","abstract":[{"lang":"eng","text":"Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan (FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public verification key and proofs accompanying the\r\noutput enable all parties to verify the correctness of the output. How-\r\never, all known standard model VRFs have a reduction loss that is much\r\nworse than what one would expect from known optimal constructions of\r\nclosely related primitives like unique signatures. We show that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries. To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16) to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We answer this ques-\r\ntion in the affirmative by presenting the first VRF with a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability of tight verifiable\r\nrandom functions: We show that a security loss of Q is unavoidable and\r\npresent the first construction that achieves this bound."}]},{"user_id":"48192","abstract":[{"lang":"eng","text":"Graph neural networks (GNNs) have been successfully applied in many structured data domains, with applications ranging from molecular property prediction to the analysis of social networks. Motivated by the broad applicability of GNNs, we propose the family of so-called RankGNNs, a combination of neural Learning to Rank (LtR) methods and GNNs. RankGNNs are trained with a set of pair-wise preferences between graphs, suggesting that one of them is preferred over the other. One practical application of this problem is drug screening, where an expert wants to find the most promising molecules in a large collection of drug candidates. We empirically demonstrate that our proposed pair-wise RankGNN approach either significantly outperforms or at least matches the ranking performance of the naive point-wise baseline approach, in which the LtR problem is solved via GNN-based graph regression."}],"volume":12986,"status":"public","date_created":"2021-11-11T14:15:18Z","publisher":"Springer","quality_controlled":"1","author":[{"first_name":"Clemens","orcid":"0000-0002-0455-0048","full_name":"Damke, Clemens","last_name":"Damke","id":"48192"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"publication":"Proceedings of The 24th International Conference on Discovery Science (DS 2021)","keyword":["Graph-structured data","Graph neural networks","Preference learning","Learning to rank"],"intvolume":" 12986","_id":"27381","conference":{"end_date":"2021-10-13","name":"24th International Conference on Discovery Science","start_date":"2021-10-11","location":"Halifax, Canada"},"year":"2021","type":"conference","citation":{"ieee":"C. Damke and E. Hüllermeier, “Ranking Structured Objects with Graph Neural Networks,” in Proceedings of The 24th International Conference on Discovery Science (DS 2021), Halifax, Canada, 2021, vol. 12986, pp. 166–180, doi: 10.1007/978-3-030-88942-5.","short":"C. Damke, E. Hüllermeier, in: C. Soares, L. Torgo (Eds.), Proceedings of The 24th International Conference on Discovery Science (DS 2021), Springer, 2021, pp. 166–180.","bibtex":"@inproceedings{Damke_Hüllermeier_2021, series={Lecture Notes in Computer Science}, title={Ranking Structured Objects with Graph Neural Networks}, volume={12986}, DOI={10.1007/978-3-030-88942-5}, booktitle={Proceedings of The 24th International Conference on Discovery Science (DS 2021)}, publisher={Springer}, author={Damke, Clemens and Hüllermeier, Eyke}, editor={Soares, Carlos and Torgo, Luis}, year={2021}, pages={166–180}, collection={Lecture Notes in Computer Science} }","mla":"Damke, Clemens, and Eyke Hüllermeier. “Ranking Structured Objects with Graph Neural Networks.” Proceedings of The 24th International Conference on Discovery Science (DS 2021), edited by Carlos Soares and Luis Torgo, vol. 12986, Springer, 2021, pp. 166–80, doi:10.1007/978-3-030-88942-5.","ama":"Damke C, Hüllermeier E. Ranking Structured Objects with Graph Neural Networks. In: Soares C, Torgo L, eds. Proceedings of The 24th International Conference on Discovery Science (DS 2021). Vol 12986. Lecture Notes in Computer Science. Springer; 2021:166-180. doi:10.1007/978-3-030-88942-5","apa":"Damke, C., & Hüllermeier, E. (2021). Ranking Structured Objects with Graph Neural Networks. In C. Soares & L. Torgo (Eds.), Proceedings of The 24th International Conference on Discovery Science (DS 2021) (Vol. 12986, pp. 166–180). Springer. https://doi.org/10.1007/978-3-030-88942-5","chicago":"Damke, Clemens, and Eyke Hüllermeier. “Ranking Structured Objects with Graph Neural Networks.” In Proceedings of The 24th International Conference on Discovery Science (DS 2021), edited by Carlos Soares and Luis Torgo, 12986:166–80. Lecture Notes in Computer Science. Springer, 2021. https://doi.org/10.1007/978-3-030-88942-5."},"page":"166-180","title":"Ranking Structured Objects with Graph Neural Networks","external_id":{"arxiv":["2104.08869"]},"editor":[{"full_name":"Soares, Carlos","first_name":"Carlos","last_name":"Soares"},{"last_name":"Torgo","full_name":"Torgo, Luis","first_name":"Luis"}],"publication_identifier":{"isbn":["9783030889418","9783030889425"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","department":[{"_id":"355"}],"doi":"10.1007/978-3-030-88942-5","date_updated":"2022-04-11T22:08:12Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"title":"Beep-And-Sleep: Message and Energy Efficient Set Cover","user_id":"477","place":"Cham","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"]},"status":"public","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"1","name":"SFB 901: SFB 901"}],"date_created":"2021-10-26T12:06:04Z","author":[{"full_name":"Götte, Thorsten","first_name":"Thorsten","id":"34727","last_name":"Götte"},{"full_name":"Kolb, Christina","first_name":"Christina","id":"43647","last_name":"Kolb"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Julian","full_name":"Werthmann, Julian","last_name":"Werthmann","id":"50024"}],"publication":"Algorithms for Sensor Systems (ALGOSENSORS '21)","doi":"10.1007/978-3-030-89240-1_7","date_updated":"2022-11-18T10:01:36Z","_id":"26888","conference":{"location":"Lisbon, Portgual","name":"ALGOSENSORS 2021"},"citation":{"bibtex":"@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep: Message and Energy Efficient Set Cover}, DOI={10.1007/978-3-030-89240-1_7}, booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021} }","mla":"Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.","ama":"Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy Efficient Set Cover. In: Algorithms for Sensor Systems (ALGOSENSORS ’21). ; 2021. doi:10.1007/978-3-030-89240-1_7","apa":"Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2021). Beep-And-Sleep: Message and Energy Efficient Set Cover. In Algorithms for Sensor Systems (ALGOSENSORS ’21). ALGOSENSORS 2021, Lisbon, Portgual. https://doi.org/10.1007/978-3-030-89240-1_7","chicago":"Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann. “Beep-And-Sleep: Message and Energy Efficient Set Cover.” In Algorithms for Sensor Systems (ALGOSENSORS ’21). Cham, 2021. https://doi.org/10.1007/978-3-030-89240-1_7.","ieee":"T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message and Energy Efficient Set Cover,” in Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.","short":"T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021."},"year":"2021","type":"book_chapter","language":[{"iso":"eng"}]},{"title":"Issuer-Hiding Attribute-Based Credentials","user_id":"27207","place":"Cham","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030925475","9783030925482"]},"publication_status":"published","status":"public","date_created":"2022-01-27T13:00:21Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"author":[{"last_name":"Bobolz","id":"27207","first_name":"Jan","full_name":"Bobolz, Jan"},{"last_name":"Eidens","id":"25078","first_name":"Fabian","full_name":"Eidens, Fabian"},{"last_name":"Krenn","full_name":"Krenn, Stephan","first_name":"Stephan"},{"last_name":"Ramacher","full_name":"Ramacher, Sebastian","first_name":"Sebastian"},{"last_name":"Samelin","first_name":"Kai","full_name":"Samelin, Kai"}],"publisher":"Springer International Publishing","department":[{"_id":"7"},{"_id":"64"}],"publication":"Cryptology and Network Security","doi":"10.1007/978-3-030-92548-2_9","date_updated":"2022-01-27T13:02:23Z","_id":"29566","year":"2021","type":"conference","citation":{"short":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021.","ieee":"J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding Attribute-Based Credentials,” 2021, doi: 10.1007/978-3-030-92548-2_9.","chicago":"Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai Samelin. “Issuer-Hiding Attribute-Based Credentials.” In Cryptology and Network Security. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-92548-2_9.","apa":"Bobolz, J., Eidens, F., Krenn, S., Ramacher, S., & Samelin, K. (2021). Issuer-Hiding Attribute-Based Credentials. Cryptology and Network Security. https://doi.org/10.1007/978-3-030-92548-2_9","ama":"Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based Credentials. In: Cryptology and Network Security. Springer International Publishing; 2021. doi:10.1007/978-3-030-92548-2_9","bibtex":"@inproceedings{Bobolz_Eidens_Krenn_Ramacher_Samelin_2021, place={Cham}, title={Issuer-Hiding Attribute-Based Credentials}, DOI={10.1007/978-3-030-92548-2_9}, booktitle={Cryptology and Network Security}, publisher={Springer International Publishing}, author={Bobolz, Jan and Eidens, Fabian and Krenn, Stephan and Ramacher, Sebastian and Samelin, Kai}, year={2021} }","mla":"Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.” Cryptology and Network Security, Springer International Publishing, 2021, doi:10.1007/978-3-030-92548-2_9."},"language":[{"iso":"eng"}]},{"date_created":"2022-08-17T07:14:41Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9783030824044","9783030824051"],"issn":["0302-9743","1611-3349"]},"publication":"The Next Wave of Sociotechnical Design","department":[{"_id":"196"}],"author":[{"full_name":"Nagbøl, Per Rådberg","first_name":"Per Rådberg","last_name":"Nagbøl"},{"last_name":"Müller","first_name":"Oliver","full_name":"Müller, Oliver"},{"last_name":"Krancher","first_name":"Oliver","full_name":"Krancher, Oliver"}],"publisher":"Springer International Publishing","user_id":"72849","title":"Designing a Risk Assessment Tool for Artificial Intelligence Systems","place":"Cham","language":[{"iso":"eng"}],"year":"2021","type":"book_chapter","citation":{"short":"P.R. Nagbøl, O. Müller, O. Krancher, in: The Next Wave of Sociotechnical Design, Springer International Publishing, Cham, 2021.","ieee":"P. R. Nagbøl, O. Müller, and O. Krancher, “Designing a Risk Assessment Tool for Artificial Intelligence Systems,” in The Next Wave of Sociotechnical Design, Cham: Springer International Publishing, 2021.","apa":"Nagbøl, P. R., Müller, O., & Krancher, O. (2021). Designing a Risk Assessment Tool for Artificial Intelligence Systems. In The Next Wave of Sociotechnical Design. Springer International Publishing. https://doi.org/10.1007/978-3-030-82405-1_32","ama":"Nagbøl PR, Müller O, Krancher O. Designing a Risk Assessment Tool for Artificial Intelligence Systems. In: The Next Wave of Sociotechnical Design. Springer International Publishing; 2021. doi:10.1007/978-3-030-82405-1_32","chicago":"Nagbøl, Per Rådberg, Oliver Müller, and Oliver Krancher. “Designing a Risk Assessment Tool for Artificial Intelligence Systems.” In The Next Wave of Sociotechnical Design. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-82405-1_32.","bibtex":"@inbook{Nagbøl_Müller_Krancher_2021, place={Cham}, title={Designing a Risk Assessment Tool for Artificial Intelligence Systems}, DOI={10.1007/978-3-030-82405-1_32}, booktitle={The Next Wave of Sociotechnical Design}, publisher={Springer International Publishing}, author={Nagbøl, Per Rådberg and Müller, Oliver and Krancher, Oliver}, year={2021} }","mla":"Nagbøl, Per Rådberg, et al. “Designing a Risk Assessment Tool for Artificial Intelligence Systems.” The Next Wave of Sociotechnical Design, Springer International Publishing, 2021, doi:10.1007/978-3-030-82405-1_32."},"doi":"10.1007/978-3-030-82405-1_32","date_updated":"2022-08-17T07:16:00Z","_id":"32868"},{"_id":"29292","type":"book_chapter","year":"2021","citation":{"bibtex":"@inbook{Feldhans_Wilke_Heindorf_Shaker_Hammer_Ngonga Ngomo_Hüllermeier_2021, place={Cham}, title={Drift Detection in Text Data with Document Embeddings}, DOI={10.1007/978-3-030-91608-4_11}, booktitle={Intelligent Data Engineering and Automated Learning – IDEAL 2021}, publisher={Springer International Publishing}, author={Feldhans, Robert and Wilke, Adrian and Heindorf, Stefan and Shaker, Mohammad Hossein and Hammer, Barbara and Ngonga Ngomo, Axel-Cyrille and Hüllermeier, Eyke}, year={2021} }","mla":"Feldhans, Robert, et al. “Drift Detection in Text Data with Document Embeddings.” Intelligent Data Engineering and Automated Learning – IDEAL 2021, Springer International Publishing, 2021, doi:10.1007/978-3-030-91608-4_11.","chicago":"Feldhans, Robert, Adrian Wilke, Stefan Heindorf, Mohammad Hossein Shaker, Barbara Hammer, Axel-Cyrille Ngonga Ngomo, and Eyke Hüllermeier. “Drift Detection in Text Data with Document Embeddings.” In Intelligent Data Engineering and Automated Learning – IDEAL 2021. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-91608-4_11.","ama":"Feldhans R, Wilke A, Heindorf S, et al. Drift Detection in Text Data with Document Embeddings. In: Intelligent Data Engineering and Automated Learning – IDEAL 2021. Springer International Publishing; 2021. doi:10.1007/978-3-030-91608-4_11","apa":"Feldhans, R., Wilke, A., Heindorf, S., Shaker, M. H., Hammer, B., Ngonga Ngomo, A.-C., & Hüllermeier, E. (2021). Drift Detection in Text Data with Document Embeddings. In Intelligent Data Engineering and Automated Learning – IDEAL 2021. Springer International Publishing. https://doi.org/10.1007/978-3-030-91608-4_11","ieee":"R. Feldhans et al., “Drift Detection in Text Data with Document Embeddings,” in Intelligent Data Engineering and Automated Learning – IDEAL 2021, Cham: Springer International Publishing, 2021.","short":"R. Feldhans, A. Wilke, S. Heindorf, M.H. Shaker, B. Hammer, A.-C. Ngonga Ngomo, E. Hüllermeier, in: Intelligent Data Engineering and Automated Learning – IDEAL 2021, Springer International Publishing, Cham, 2021."},"main_file_link":[{"open_access":"1","url":"https://papers.dice-research.org/2021/IDEAL2021_DriftDetectionEmbeddings/Drift-Detection-in-Text-Data-with-Document-Embeddings-public.pdf"}],"user_id":"11871","date_created":"2022-01-12T10:27:23Z","status":"public","publication":"Intelligent Data Engineering and Automated Learning – IDEAL 2021","publisher":"Springer International Publishing","author":[{"first_name":"Robert","full_name":"Feldhans, Robert","last_name":"Feldhans"},{"last_name":"Wilke","id":"9101","first_name":"Adrian","orcid":"0000-0002-6575-807X","full_name":"Wilke, Adrian"},{"last_name":"Heindorf","id":"11871","first_name":"Stefan","orcid":"0000-0002-4525-6865","full_name":"Heindorf, Stefan"},{"last_name":"Shaker","first_name":"Mohammad Hossein","full_name":"Shaker, Mohammad Hossein"},{"full_name":"Hammer, Barbara","first_name":"Barbara","last_name":"Hammer"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"}],"oa":"1","doi":"10.1007/978-3-030-91608-4_11","date_updated":"2022-10-15T19:54:20Z","language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-030-91608-4_11","relation":"confirmation"}]},"title":"Drift Detection in Text Data with Document Embeddings","place":"Cham","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030916077","9783030916084"]},"publication_status":"published","department":[{"_id":"574"}]},{"publication":"Logical Foundations of Computer Science","publisher":"Springer International Publishing","author":[{"last_name":"Kontinen","first_name":"Juha","full_name":"Kontinen, Juha"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"},{"last_name":"Mahmood","first_name":"Yasir","full_name":"Mahmood, Yasir"}],"date_created":"2023-07-03T11:36:33Z","status":"public","publication_identifier":{"isbn":["9783030930998","9783030931001"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Cham","user_id":"99353","title":"A Parameterized View on the Complexity of Dependence Logic","language":[{"iso":"eng"}],"type":"conference","citation":{"short":"J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science, Springer International Publishing, Cham, 2021.","ieee":"J. Kontinen, A. Meier, and Y. Mahmood, “A Parameterized View on the Complexity of Dependence Logic,” 2021, doi: 10.1007/978-3-030-93100-1_9.","apa":"Kontinen, J., Meier, A., & Mahmood, Y. (2021). A Parameterized View on the Complexity of Dependence Logic. Logical Foundations of Computer Science. https://doi.org/10.1007/978-3-030-93100-1_9","ama":"Kontinen J, Meier A, Mahmood Y. A Parameterized View on the Complexity of Dependence Logic. In: Logical Foundations of Computer Science. Springer International Publishing; 2021. doi:10.1007/978-3-030-93100-1_9","chicago":"Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence Logic.” In Logical Foundations of Computer Science. Cham: Springer International Publishing, 2021. https://doi.org/10.1007/978-3-030-93100-1_9.","mla":"Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence Logic.” Logical Foundations of Computer Science, Springer International Publishing, 2021, doi:10.1007/978-3-030-93100-1_9.","bibtex":"@inproceedings{Kontinen_Meier_Mahmood_2021, place={Cham}, title={A Parameterized View on the Complexity of Dependence Logic}, DOI={10.1007/978-3-030-93100-1_9}, booktitle={Logical Foundations of Computer Science}, publisher={Springer International Publishing}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2021} }"},"year":"2021","date_updated":"2023-07-03T11:44:42Z","_id":"45846","doi":"10.1007/978-3-030-93100-1_9"}]