{"id":41,"date":"2023-04-23T11:24:22","date_gmt":"2023-04-23T09:24:22","guid":{"rendered":"https:\/\/forschungsnetzwerk-anonymisierung.de\/?page_id=41"},"modified":"2024-01-30T22:01:31","modified_gmt":"2024-01-30T21:01:31","slug":"publikationen","status":"publish","type":"page","link":"https:\/\/www.forschungsnetzwerk-anonymisierung.de\/index.php\/publikationen","title":{"rendered":"Publikationen"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-page\" data-elementor-id=\"41\" class=\"elementor elementor-41\" data-elementor-settings=\"{&quot;ha_cmc_init_switcher&quot;:&quot;no&quot;}\" data-elementor-post-type=\"page\">\n\t\t\t\t<div class=\"elementor-element elementor-element-e9fb310 e-flex e-con-boxed e-con e-parent\" data-id=\"e9fb310\" data-element_type=\"container\" data-e-type=\"container\" data-settings=\"{&quot;background_background&quot;:&quot;classic&quot;,&quot;background_motion_fx_motion_fx_scrolling&quot;:&quot;yes&quot;,&quot;background_motion_fx_translateY_effect&quot;:&quot;yes&quot;,&quot;background_motion_fx_translateY_speed&quot;:{&quot;unit&quot;:&quot;px&quot;,&quot;size&quot;:6.8,&quot;sizes&quot;:[]},&quot;background_motion_fx_translateY_affectedRange&quot;:{&quot;unit&quot;:&quot;%&quot;,&quot;size&quot;:&quot;&quot;,&quot;sizes&quot;:{&quot;start&quot;:0,&quot;end&quot;:100}},&quot;background_motion_fx_devices&quot;:[&quot;desktop&quot;,&quot;tablet&quot;,&quot;mobile&quot;],&quot;_ha_eqh_enable&quot;:false}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-2d5b0f3 elementor-widget elementor-widget-text-editor\" data-id=\"2d5b0f3\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p>Hier finden Sie Ver\u00f6ffentlichungen zu aktuellen Themen des Forschungsnetzwerks Anonymisierung.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t<div class=\"elementor-element elementor-element-45cf641 e-flex e-con-boxed e-con e-parent\" data-id=\"45cf641\" data-element_type=\"container\" data-e-type=\"container\" data-settings=\"{&quot;background_background&quot;:&quot;classic&quot;,&quot;_ha_eqh_enable&quot;:false}\">\n\t\t\t\t\t<div class=\"e-con-inner\">\n\t\t\t\t<div class=\"elementor-element elementor-element-259b95e elementor-widget elementor-widget-shortcode\" data-id=\"259b95e\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"shortcode.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t<div class=\"elementor-shortcode\"><div class=\"teachpress_pub_list\"><form name=\"tppublistform\" method=\"get\"><a name=\"tppubs\" id=\"tppubs\"><\/a><div class=\"tp_search_input\"><input name=\"tsr\" id=\"tp_search_input_field\" type=\"search\" placeholder=\"Enter search word\" value=\"\" tabindex=\"1\"\/><div class=\"teachpress_search_button\"><input name=\"tps_button\" class=\"tp_search_button\" type=\"submit\" tabindex=\"10\" value=\"Search\"\/><\/div><\/div><\/form><div class=\"tablenav\"><div class=\"tablenav-pages\"><span class=\"displaying-num\">63 entries<\/span> <a class=\"page-numbers button disabled\">&laquo;<\/a> <a class=\"page-numbers button disabled\">&lsaquo;<\/a> 1 of 4 <a href=\"\/index.php\/publikationen?limit=2&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"next page\" class=\"page-numbers button\">&rsaquo;<\/a> <a href=\"\/index.php\/publikationen?limit=4&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"last page\" class=\"page-numbers button\">&raquo;<\/a> <\/div><\/div><div class=\"teachpress_publication_list\"><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">1.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Marc S Seibel, Jens Haueisen;  Jochmann, Thomas<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('61','tp_links')\" style=\"cursor:pointer;\">How much EEG is needed for deep learning with convolutional neural networks? Predicting the benefit from additional data<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">Journal of Neural Engineering, <\/span><span class=\"tp_pub_additional_year\">2026<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_61\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('61','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_61\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('61','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_61\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{nokey,<br \/>\r\ntitle = {How much EEG is needed for deep learning with convolutional neural networks? Predicting the benefit from additional data},<br \/>\r\nauthor = {Marc S Seibel, Jens Haueisen and Thomas Jochmann},<br \/>\r\ndoi = {10.1088\/1741-2552\/ae453d},<br \/>\r\nyear  = {2026},<br \/>\r\ndate = {2026-02-25},<br \/>\r\njournal = {Journal of Neural Engineering},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('61','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_61\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1088\/1741-2552\/ae453d\" title=\"Follow DOI:10.1088\/1741-2552\/ae453d\" target=\"_blank\">doi:10.1088\/1741-2552\/ae453d<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('61','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_misc\"><div class=\"tp_pub_number\">2.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Peinemann, Thorsten;  Arnold, Paula;  Berndt, Sebastian;  Eisenbarth, Thomas;  Mohammadi, Esfandiar<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('53','tp_links')\" style=\"cursor:pointer;\">Non-omniscient backdoor injection with one poison sample: Proving the one-poison hypothesis for linear regression, linear classification, and 2-layer ReLU neural networks<\/a> <span class=\"tp_pub_type tp_  misc\">Miscellaneous<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2026<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_53\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('53','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_53\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('53','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_53\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@misc{peinemann2026nonomniscientbackdoorinjectionpoison,<br \/>\r\ntitle = {Non-omniscient backdoor injection with one poison sample: Proving the one-poison hypothesis for linear regression, linear classification, and 2-layer ReLU neural networks},<br \/>\r\nauthor = {Thorsten Peinemann and Paula Arnold and Sebastian Berndt and Thomas Eisenbarth and Esfandiar Mohammadi},<br \/>\r\nurl = {https:\/\/arxiv.org\/abs\/2508.05600},<br \/>\r\nyear  = {2026},<br \/>\r\ndate = {2026-01-01},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {misc}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('53','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_53\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-arxiv\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/arxiv.org\/abs\/2508.05600\" title=\"https:\/\/arxiv.org\/abs\/2508.05600\" target=\"_blank\">https:\/\/arxiv.org\/abs\/2508.05600<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('53','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_inproceedings\"><div class=\"tp_pub_number\">3.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Maurer, Felix;  Sander, Jonas;  Eisenbarth, Thomas<\/p><p class=\"tp_pub_title\">ReDASH: Fast and\u00a0Efficient Scaling in\u00a0Arithmetic Garbled Circuits for\u00a0Secure Outsourced Inference <span class=\"tp_pub_type tp_  inproceedings\">Proceedings Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span> Manulis, Mark (Ed.): <span class=\"tp_pub_additional_booktitle\">Applied Cryptography and Network Security Workshops, <\/span><span class=\"tp_pub_additional_pages\">pp. 43\u201351, <\/span><span class=\"tp_pub_additional_publisher\">Springer Nature Switzerland, <\/span><span class=\"tp_pub_additional_address\">Cham, <\/span><span class=\"tp_pub_additional_year\">2026<\/span>, <span class=\"tp_pub_additional_isbn\">ISBN: 978-3-032-01823-6<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_57\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('57','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_57\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('57','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_57\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@inproceedings{10.1007\/978-3-032-01823-6_3,<br \/>\r\ntitle = {ReDASH: Fast and\u00a0Efficient Scaling in\u00a0Arithmetic Garbled Circuits for\u00a0Secure Outsourced Inference},<br \/>\r\nauthor = {Felix Maurer and Jonas Sander and Thomas Eisenbarth},<br \/>\r\neditor = {Mark Manulis},<br \/>\r\nisbn = {978-3-032-01823-6},<br \/>\r\nyear  = {2026},<br \/>\r\ndate = {2026-01-01},<br \/>\r\nbooktitle = {Applied Cryptography and Network Security Workshops},<br \/>\r\npages = {43\u201351},<br \/>\r\npublisher = {Springer Nature Switzerland},<br \/>\r\naddress = {Cham},<br \/>\r\nabstract = {ReDash extends Dash's arithmetic garbled circuits to provide a more flexible and efficient framework for secure outsourced inference. By introducing a novel garbled scaling gadget based on a generalized base extension for the residue number system, ReDash removes Dash's limitation of scaling exclusively by powers of two. This enables arbitrary scaling factors drawn from the residue number system's modular base, allowing for tailored quantization schemes and more efficient model evaluation.},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {inproceedings}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('57','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_57\" style=\"display:none;\"><div class=\"tp_abstract_entry\">ReDash extends Dash's arithmetic garbled circuits to provide a more flexible and efficient framework for secure outsourced inference. By introducing a novel garbled scaling gadget based on a generalized base extension for the residue number system, ReDash removes Dash's limitation of scaling exclusively by powers of two. This enables arbitrary scaling factors drawn from the residue number system's modular base, allowing for tailored quantization schemes and more efficient model evaluation.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('57','tp_abstract')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_inproceedings\"><div class=\"tp_pub_number\">4.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Boy, Jeremy;  Purnal, Antoon;  P\u00e4tschke, Anna;  Wilke, Luca;  Eisenbarth, Thomas<\/p><p class=\"tp_pub_title\">SLasH-DSA: Breaking SLH-DSA Using an Extensible End-To-End Rowhammer Framework <span class=\"tp_pub_type tp_  inproceedings\">Proceedings Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_booktitle\">2nd Microarchitecture Security Conference (\u00b5 ASC '26), <\/span><span class=\"tp_pub_additional_year\">2026<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_60\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('60','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_60\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@inproceedings{boySLasHDSABreakingSLHDSA2026,<br \/>\r\ntitle = {SLasH-DSA: Breaking SLH-DSA Using an Extensible End-To-End Rowhammer Framework},<br \/>\r\nauthor = {Jeremy Boy and Antoon Purnal and Anna P\u00e4tschke and Luca Wilke and Thomas Eisenbarth},<br \/>\r\nyear  = {2026},<br \/>\r\ndate = {2026-01-01},<br \/>\r\nbooktitle = {2nd Microarchitecture Security Conference (\u00b5 ASC '26)},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {inproceedings}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('60','tp_bibtex')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">5.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Schaffland, Axel;  Sch\u00f6ning, Julius<\/p><p class=\"tp_pub_title\">Urban Traffic Forecasting, Urban Data Platforms and Urban Foundations Models <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_booktitle\">2025 7th Experiment@ International Conference (exp.at&#039;25), <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_45\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('45','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_45\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Schaffland2025c,<br \/>\r\ntitle = {Urban Traffic Forecasting, Urban Data Platforms and Urban Foundations Models},<br \/>\r\nauthor = {Axel Schaffland and Julius Sch\u00f6ning },<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-12-01},<br \/>\r\nbooktitle = {2025 7th Experiment@ International Conference (exp.at&#039;25)},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('45','tp_bibtex')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">6.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Schaffland, Axel;  Sch\u00f6ning, Julius<\/p><p class=\"tp_pub_title\">Multi-step, Multi-scale Traffic Flow Time Series Forecasting <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">IEEE Access, <\/span><span class=\"tp_pub_additional_year\">2025<\/span><span class=\"tp_pub_additional_note\">, (Submitted to IEEE Access (under review))<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_46\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('46','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_46\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{Schaffland202x,<br \/>\r\ntitle = {Multi-step, Multi-scale Traffic Flow Time Series Forecasting},<br \/>\r\nauthor = {Axel Schaffland and Julius Sch\u00f6ning },<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-12-01},<br \/>\r\njournal = {IEEE Access},<br \/>\r\npublisher = {IEEE Access},<br \/>\r\nnote = {Submitted to IEEE Access (under review)},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('46','tp_bibtex')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">7.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Kruse, Niklas;  Sch\u00f6ning, Julius<\/p><p class=\"tp_pub_title\">Urban Digital Twins, Law Compliance and Anonymity: Two Case Studies from the Field of Mobility <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">Computer Law &amp; Security Review, <\/span><span class=\"tp_pub_additional_year\">2025<\/span><span class=\"tp_pub_additional_note\">, (Submitted to Computer Law &amp; Security Review, Elsevier BV (under review))<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_48\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('48','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_48\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{kruse202x,<br \/>\r\ntitle = {Urban Digital Twins, Law Compliance and Anonymity: Two Case Studies from the Field of Mobility},<br \/>\r\nauthor = {Niklas Kruse and Julius Sch\u00f6ning },<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-12-01},<br \/>\r\njournal = {Computer Law & Security Review},<br \/>\r\nnote = {Submitted to Computer Law & Security Review, Elsevier BV (under review)},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('48','tp_bibtex')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_online\"><div class=\"tp_pub_number\">8.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Fries, Christian;  Kettler, Jan;  Pa\u00dffeld, Thorsten;  T\u00f6njes, Ralf;  Kray, Christian<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('49','tp_links')\" style=\"cursor:pointer;\">Quantifying the Impact of k-Anonymizing Trajectory Data on Common Traffic Management Use Cases<\/a> <span class=\"tp_pub_type tp_  online\">Online<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_49\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('49','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_49\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('49','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_49\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@online{Fries202510271107,<br \/>\r\ntitle = {Quantifying the Impact of k-Anonymizing Trajectory Data on Common Traffic Management Use Cases},<br \/>\r\nauthor = {Christian Fries and Jan Kettler and Thorsten Pa\u00dffeld and Ralf T\u00f6njes and Christian Kray},<br \/>\r\nurl = {https:\/\/sigspatial2025.sigspatial.org\/research-accepted\/},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-12-01},<br \/>\r\nhowpublished = {33rd ACM SIGSPATIAL, Minneapolis, USA, 2025},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {online}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('49','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_49\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/sigspatial2025.sigspatial.org\/research-accepted\/\" title=\"https:\/\/sigspatial2025.sigspatial.org\/research-accepted\/\" target=\"_blank\">https:\/\/sigspatial2025.sigspatial.org\/research-accepted\/<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('49','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">9.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Luttermann, Malte;  M\u00f6ller, Ralf;  Gehrke, Marcel<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('43','tp_links')\" style=\"cursor:pointer;\">Lifted Model Construction without Normalisation: A Vectorised Approach to Exploit Symmetries in Factor Graphs<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_booktitle\">Proceedings of the Third Learning on Graphs Conference, <\/span><span class=\"tp_pub_additional_volume\">vol. 269, <\/span><span class=\"tp_pub_additional_series\">Proceedings of Machine Learning Research <\/span><span class=\"tp_pub_additional_publisher\">PMLR, <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_43\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('43','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_43\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('43','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_43\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('43','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_43\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{pmlr-v269-luttermann25a,<br \/>\r\ntitle = {Lifted Model Construction without Normalisation: A Vectorised Approach to Exploit Symmetries in Factor Graphs},<br \/>\r\nauthor = {Malte Luttermann and Ralf M\u00f6ller and Marcel Gehrke},<br \/>\r\neditor = {Guy Wolf and Smita Krishnaswamy},<br \/>\r\nurl = {https:\/\/proceedings.mlr.press\/v269\/luttermann25a.html<br \/>\r\nhttps:\/\/raw.githubusercontent.com\/mlresearch\/v269\/main\/assets\/luttermann25a\/luttermann25a.pdf},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-11-26},<br \/>\r\nurldate = {2025-11-26},<br \/>\r\nbooktitle = {Proceedings of the Third Learning on Graphs Conference},<br \/>\r\nvolume = {269},<br \/>\r\npages = {46:1--46:17},<br \/>\r\npublisher = {PMLR},<br \/>\r\nseries = {Proceedings of Machine Learning Research},<br \/>\r\nabstract = {Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for tractable probabilistic inference with respect to domain sizes of logical variables. We found that the current state-of-the-art algorithm to construct a lifted representation in form of a parametric factor graph misses symmetries between factors that are exchangeable but scaled differently, thereby leading to a less compact representation. In this paper, we propose a generalisation of the advanced colour passing (ACP) algorithm, which is the state of the art to construct a parametric factor graph. Our proposed algorithm allows for potentials of factors to be scaled arbitrarily and efficiently detects more symmetries than the original ACP algorithm. By detecting strictly more symmetries than ACP, our algorithm significantly reduces online query times for probabilistic inference when the resulting model is applied, which we also confirm in our experiments. },<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('43','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_43\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for tractable probabilistic inference with respect to domain sizes of logical variables. We found that the current state-of-the-art algorithm to construct a lifted representation in form of a parametric factor graph misses symmetries between factors that are exchangeable but scaled differently, thereby leading to a less compact representation. In this paper, we propose a generalisation of the advanced colour passing (ACP) algorithm, which is the state of the art to construct a parametric factor graph. Our proposed algorithm allows for potentials of factors to be scaled arbitrarily and efficiently detects more symmetries than the original ACP algorithm. By detecting strictly more symmetries than ACP, our algorithm significantly reduces online query times for probabilistic inference when the resulting model is applied, which we also confirm in our experiments. <\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('43','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_43\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/proceedings.mlr.press\/v269\/luttermann25a.html\" title=\"https:\/\/proceedings.mlr.press\/v269\/luttermann25a.html\" target=\"_blank\">https:\/\/proceedings.mlr.press\/v269\/luttermann25a.html<\/a><\/li><li><i class=\"fas fa-file-pdf\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/raw.githubusercontent.com\/mlresearch\/v269\/main\/assets\/luttermann25a\/luttermann25a.pdf\" title=\"https:\/\/raw.githubusercontent.com\/mlresearch\/v269\/main\/assets\/luttermann25a\/lutt[...]\" target=\"_blank\">https:\/\/raw.githubusercontent.com\/mlresearch\/v269\/main\/assets\/luttermann25a\/lutt[...]<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('43','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">10.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\">Noah Erthel Bernd Gruner, Clemens-Alexander Brust<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('66','tp_links')\" style=\"cursor:pointer;\">FlowStrider: Low-Friction Continuous Threat Modeling<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_booktitle\">40th IEEE\/ACM International Conference on Automated Software Engineering (ASE), <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_66\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('66','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_66\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('66','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_66\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{nokey,<br \/>\r\ntitle = {FlowStrider: Low-Friction Continuous Threat Modeling},<br \/>\r\nauthor = {Bernd Gruner, Noah Erthel, Clemens-Alexander Brust},<br \/>\r\nurl = {https:\/\/ieeexplore.ieee.org\/document\/11334490\/authors#authors},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-11-20},<br \/>\r\nbooktitle = {40th IEEE\/ACM International Conference on Automated Software Engineering (ASE)},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('66','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_66\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/ieeexplore.ieee.org\/document\/11334490\/authors#authors\" title=\"https:\/\/ieeexplore.ieee.org\/document\/11334490\/authors#authors\" target=\"_blank\">https:\/\/ieeexplore.ieee.org\/document\/11334490\/authors#authors<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('66','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_incollection\"><div class=\"tp_pub_number\">11.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Speller, Jan;  Luttermann, Malte;  Gehrke, Marcel;  Braun, Tanya<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('51','tp_links')\" style=\"cursor:pointer;\">Compression Versus Accuracy: A Hierarchy of Lifted Models<\/a> <span class=\"tp_pub_type tp_  incollection\">Book Section<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_volume\">vol. 413: ECAI 2025, <\/span><span class=\"tp_pub_additional_pages\">pp. 5051 - 5058, <\/span><span class=\"tp_pub_additional_publisher\">IOS Press, <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_51\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('51','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_51\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('51','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_51\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('51','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_51\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@incollection{Speller2025b,<br \/>\r\ntitle = {Compression Versus Accuracy: A Hierarchy of Lifted Models},<br \/>\r\nauthor = {Jan Speller and Malte Luttermann and Marcel Gehrke and Tanya Braun},<br \/>\r\nurl = {https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA251420},<br \/>\r\ndoi = { 10.3233\/FAIA251420},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-10-30},<br \/>\r\nurldate = {2025-10-30},<br \/>\r\nvolume = {413: ECAI 2025},<br \/>\r\npages = {5051 - 5058},<br \/>\r\npublisher = {IOS Press},<br \/>\r\nseries = { Frontiers in Artificial Intelligence and Applications},<br \/>\r\nabstract = {Proceedings of the Twenty-Eighth European Conference on Artificial Intelligence (ECAI-2025).},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {incollection}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('51','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_51\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Proceedings of the Twenty-Eighth European Conference on Artificial Intelligence (ECAI-2025).<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('51','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_51\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA251420\" title=\"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA251420\" target=\"_blank\">https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA251420<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/ 10.3233\/FAIA251420\" title=\"Follow DOI: 10.3233\/FAIA251420\" target=\"_blank\">doi: 10.3233\/FAIA251420<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('51','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_inproceedings\"><div class=\"tp_pub_number\">12.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Gehrke, Marcel;  Luttermann, Malte<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('50','tp_links')\" style=\"cursor:pointer;\">StaRAI: From a Probabilistic Propositional Model to a Highly Compressed Probabilistic Relational Model (Extended Abstract)<\/a> <span class=\"tp_pub_type tp_  inproceedings\">Proceedings Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_booktitle\">Joint Proceedings of the ECSQARU 2025 Workshops and Tutorials, <\/span><span class=\"tp_pub_additional_pages\">pp. 71\u201374, <\/span><span class=\"tp_pub_additional_publisher\">HAL Open Science, <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_50\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('50','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_50\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('50','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_50\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@inproceedings{Gehrke2025a,<br \/>\r\ntitle = {StaRAI: From a Probabilistic Propositional Model to a Highly Compressed Probabilistic Relational Model (Extended Abstract)},<br \/>\r\nauthor = {Marcel Gehrke and Malte Luttermann},<br \/>\r\nurl = {https:\/\/hal.science\/hal-05294280},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-10-02},<br \/>\r\nurldate = {2025-10-02},<br \/>\r\nbooktitle = {Joint Proceedings of the ECSQARU 2025 Workshops and Tutorials},<br \/>\r\npages = {71--74},<br \/>\r\npublisher = {HAL Open Science},<br \/>\r\nseries = {Joint Proceedings of the ECSQARU 2025 Workshops and Tutorials},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {inproceedings}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('50','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_50\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/hal.science\/hal-05294280\" title=\"https:\/\/hal.science\/hal-05294280\" target=\"_blank\">https:\/\/hal.science\/hal-05294280<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('50','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_misc\"><div class=\"tp_pub_number\">13.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Schaffland, Axel;  Reuwer, Ann-Katrin<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('47','tp_links')\" style=\"cursor:pointer;\">Verkehrsz\u00e4hlungsdatensatz Osnabr\u00fcck 01.01.2022-09.11.2023<\/a> <span class=\"tp_pub_type tp_  misc\">Miscellaneous<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_howpublished\">Stadt Osnabr\u00fcck, <\/span><span class=\"tp_pub_additional_year\">2025<\/span><span class=\"tp_pub_additional_note\">, (Mobilithek ID: 903287344194932736)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_47\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('47','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_47\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('47','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_47\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('47','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_47\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@misc{mobilithek2025,<br \/>\r\ntitle = {Verkehrsz\u00e4hlungsdatensatz Osnabr\u00fcck 01.01.2022-09.11.2023},<br \/>\r\nauthor = {Axel Schaffland and Ann-Katrin Reuwer},<br \/>\r\nurl = {https:\/\/mobilithek.info\/offers\/903287344194932736},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-09-17},<br \/>\r\nabstract = {Der Datensatz enth\u00e4lt Zeitreihendaten von 66 Traffic Eye Universal (TEU) Verkehrssensoren, die den Verkehrsfluss und die Geschwindigkeit messen. Die Sensoren sind paarweise an Stra\u00dfen der Stadt Osnabr\u00fcck installiert. Ein Sensor des Paares misst in eine Fahrtrichtung, der zweite Sensor in die Gegenrichtung. Der Verkehr wird in die Kategorien Pkw, Lkw, Lkw mit Anh\u00e4nger und nicht klassifiziert unterteilt. Die Daten werden roh ohne Vorverarbeitung bereitgestellt.},<br \/>\r\nhowpublished = {Stadt Osnabr\u00fcck},<br \/>\r\nnote = {Mobilithek ID: 903287344194932736},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {misc}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('47','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_47\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Der Datensatz enth\u00e4lt Zeitreihendaten von 66 Traffic Eye Universal (TEU) Verkehrssensoren, die den Verkehrsfluss und die Geschwindigkeit messen. Die Sensoren sind paarweise an Stra\u00dfen der Stadt Osnabr\u00fcck installiert. Ein Sensor des Paares misst in eine Fahrtrichtung, der zweite Sensor in die Gegenrichtung. Der Verkehr wird in die Kategorien Pkw, Lkw, Lkw mit Anh\u00e4nger und nicht klassifiziert unterteilt. Die Daten werden roh ohne Vorverarbeitung bereitgestellt.<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('47','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_47\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/mobilithek.info\/offers\/903287344194932736\" title=\"https:\/\/mobilithek.info\/offers\/903287344194932736\" target=\"_blank\">https:\/\/mobilithek.info\/offers\/903287344194932736<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('47','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">14.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Speller, Jan;  Luttermann, Malte;  Gehrke, Marcel;  Braun, Tanya<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('52','tp_links')\" style=\"cursor:pointer;\">CHAI+FCR 2025 Humanities-Centred Artificial Intelligence 2025 and Formal &amp; Cognitive Reasoning 2025<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_booktitle\">Humanities-Centred Artificial Intelligence 2025 and Formal &amp; Cognitive Reasoning 2025, <\/span><span class=\"tp_pub_additional_volume\">vol. 4058, <\/span><span class=\"tp_pub_additional_publisher\">CEUR, <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_52\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('52','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_52\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('52','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_52\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('52','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_52\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Speller2025,<br \/>\r\ntitle = {CHAI+FCR 2025 Humanities-Centred Artificial Intelligence 2025 and Formal & Cognitive Reasoning 2025},<br \/>\r\nauthor = {Jan Speller and Malte Luttermann and Marcel Gehrke and Tanya Braun},<br \/>\r\neditor = { Sylvia Melzer and Hagen Peukert and Stefan Thiemann and Magnus Bender and \u00d6zg\u00fcr L. \u00d6z\u00e7ep and Nele Russwinkel and Kai Sauerwald and Diedrich Wolter},<br \/>\r\nurl = {https:\/\/ceur-ws.org\/Vol-4058\/},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-09-16},<br \/>\r\nbooktitle = {Humanities-Centred Artificial Intelligence 2025 and Formal & Cognitive Reasoning 2025},<br \/>\r\nvolume = {4058},<br \/>\r\npages = {41-56},<br \/>\r\npublisher = {CEUR},<br \/>\r\nabstract = {Explainability of Approximate Lifted Model Construction: A Geometric Perspective. Proceedings of the First Joint Workshop on Humanities-Centered Artificial Intelligence and Formal & Cognitive Reasoning (CHAI-2025 and FCR-2025) co-located with 48th German Conference on Artificial Intelligence (KI-2025)},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('52','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_52\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Explainability of Approximate Lifted Model Construction: A Geometric Perspective. Proceedings of the First Joint Workshop on Humanities-Centered Artificial Intelligence and Formal &amp; Cognitive Reasoning (CHAI-2025 and FCR-2025) co-located with 48th German Conference on Artificial Intelligence (KI-2025)<\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('52','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_52\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/ceur-ws.org\/Vol-4058\/\" title=\"https:\/\/ceur-ws.org\/Vol-4058\/\" target=\"_blank\">https:\/\/ceur-ws.org\/Vol-4058\/<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('52','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">15.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Luttermann, Malte;  Speller, Jan;  Gehrke, Marcel;  Braun, Tanya;  M\u00f6ller, Ralf;  Hartwig, Mattis<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('42','tp_links')\" style=\"cursor:pointer;\">Approximate Lifted Model Construction<\/a> <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_booktitle\">Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI-25}, <\/span><span class=\"tp_pub_additional_publisher\">International Joint Conferences on Artificial Intelligence Organization, <\/span><span class=\"tp_pub_additional_year\">2025<\/span><span class=\"tp_pub_additional_note\">, (Main Track)<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_abstract_link\"><a id=\"tp_abstract_sh_42\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('42','tp_abstract')\" title=\"Show abstract\" style=\"cursor:pointer;\">Abstract<\/a><\/span> | <span class=\"tp_resource_link\"><a id=\"tp_links_sh_42\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('42','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_42\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('42','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_42\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{ijcai2025p1009,<br \/>\r\ntitle = {Approximate Lifted Model Construction},<br \/>\r\nauthor = {Malte Luttermann and Jan Speller and Marcel Gehrke and Tanya Braun and Ralf M\u00f6ller and Mattis Hartwig},<br \/>\r\neditor = {James Kwok},<br \/>\r\ndoi = {10.24963\/ijcai.2025\/1009},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-08-01},<br \/>\r\nurldate = {2025-08-01},<br \/>\r\nbooktitle = {Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI-25}},<br \/>\r\npages = {9077--9085},<br \/>\r\npublisher = {International Joint Conferences on Artificial Intelligence Organization},<br \/>\r\nabstract = {Probabilistic relational models such as parametric factor graphs enable efficient (lifted) inference by exploiting the indistinguishability of objects. In lifted inference, a representative of indistinguishable objects is used for computations. To obtain a relational (i.e., lifted) representation, the Advanced Colour Passing (ACP) algorithm is the state of the art. The ACP algorithm, however, requires underlying distributions, encoded as potential-based factorisations, to exactly match to identify and exploit indistinguishabilities. Hence, ACP is unsuitable for practical applications where potentials learned from data inevitably deviate even if associated objects are indistinguishable. To mitigate this problem, we introduce the \u03b5-Advanced Colour Passing (\u03b5-ACP) algorithm, which allows for a deviation of potentials depending on a hyperparameter \u03b5. \u03b5-ACP efficiently uncovers and exploits indistinguishabilities that are not exact. We prove that the approximation error induced by \u03b5-ACP is strictly bounded and our experiments show that the approximation error is close to zero in practice. },<br \/>\r\nnote = {Main Track},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('42','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_abstract\" id=\"tp_abstract_42\" style=\"display:none;\"><div class=\"tp_abstract_entry\">Probabilistic relational models such as parametric factor graphs enable efficient (lifted) inference by exploiting the indistinguishability of objects. In lifted inference, a representative of indistinguishable objects is used for computations. To obtain a relational (i.e., lifted) representation, the Advanced Colour Passing (ACP) algorithm is the state of the art. The ACP algorithm, however, requires underlying distributions, encoded as potential-based factorisations, to exactly match to identify and exploit indistinguishabilities. Hence, ACP is unsuitable for practical applications where potentials learned from data inevitably deviate even if associated objects are indistinguishable. To mitigate this problem, we introduce the \u03b5-Advanced Colour Passing (\u03b5-ACP) algorithm, which allows for a deviation of potentials depending on a hyperparameter \u03b5. \u03b5-ACP efficiently uncovers and exploits indistinguishabilities that are not exact. We prove that the approximation error induced by \u03b5-ACP is strictly bounded and our experiments show that the approximation error is close to zero in practice. <\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('42','tp_abstract')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_42\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.24963\/ijcai.2025\/1009\" title=\"Follow DOI:10.24963\/ijcai.2025\/1009\" target=\"_blank\">doi:10.24963\/ijcai.2025\/1009<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('42','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">16.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\">Sebastian Krautwurst Marie Lataretu, Matthew R Huska<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('62','tp_links')\" style=\"cursor:pointer;\">Targeted decontamination of sequencing data with CLEAN<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">NAR Genomics &amp; Bioinformatics, <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_62\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('62','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_62\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('62','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_62\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{nokey,<br \/>\r\ntitle = {Targeted decontamination of sequencing data with CLEAN},<br \/>\r\nauthor = { Marie Lataretu, Sebastian Krautwurst, Matthew R Huska, Mike Marquet, Adrian Viehweger, Sascha D Braun, Christian Brandt, Martin H\u00f6lzer},<br \/>\r\ndoi = {10.1093\/nargab\/lqaf105},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-07-24},<br \/>\r\nurldate = {2025-07-24},<br \/>\r\njournal = {NAR Genomics & Bioinformatics},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('62','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_62\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1093\/nargab\/lqaf105\" title=\"Follow DOI:10.1093\/nargab\/lqaf105\" target=\"_blank\">doi:10.1093\/nargab\/lqaf105<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('62','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_incollection\"><div class=\"tp_pub_number\">17.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Elias K\u00fchnel, Felix Wilke<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('64','tp_links')\" style=\"cursor:pointer;\">Soziotechnische Transformationen im Sozial- und Gesundheitswesen: kollaborativ, divers, barrierefrei und sozialr\u00e4umlich <\/a> <span class=\"tp_pub_type tp_  incollection\">Book Section<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_64\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('64','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_64\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('64','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_64\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@incollection{nokey,<br \/>\r\ntitle = {Soziotechnische Transformationen im Sozial- und Gesundheitswesen: kollaborativ, divers, barrierefrei und sozialr\u00e4umlich },<br \/>\r\nauthor = {Elias K\u00fchnel, Felix Wilke},<br \/>\r\nurl = {https:\/\/www.beltz.de\/fachmedien\/soziologie\/soziotechnische-transformationen-im-sozial-und-gesundheitswesen-kollaborativ-divers-barrierefrei-und-sozialraeumlich\/BEL447855},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-06-18},<br \/>\r\nurldate = {2025-06-18},<br \/>\r\njournal = {Weinheim: BELTZ JUVENTA},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {incollection}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('64','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_64\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/www.beltz.de\/fachmedien\/soziologie\/soziotechnische-transformationen-im-sozial-und-gesundheitswesen-kollaborativ-divers-barrierefrei-und-sozialraeumlich\/BEL447855\" title=\"https:\/\/www.beltz.de\/fachmedien\/soziologie\/soziotechnische-transformationen-im-s[...]\" target=\"_blank\">https:\/\/www.beltz.de\/fachmedien\/soziologie\/soziotechnische-transformationen-im-s[...]<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('64','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_article\"><div class=\"tp_pub_number\">18.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Hanisch, Simon;  Arias-Cabarcos, Patricia;  Parra-Arnau, Javier;  Strufe, Thorsten<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('36','tp_links')\" style=\"cursor:pointer;\">Anonymization Techniques for Behavioral Biometric Data: A Survey<\/a> <span class=\"tp_pub_type tp_  article\">Journal Article<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_in\">In: <\/span><span class=\"tp_pub_additional_journal\">ACM Comput. Surv., <\/span><span class=\"tp_pub_additional_year\">2025<\/span>, <span class=\"tp_pub_additional_issn\">ISSN: 0360-0300<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_36\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('36','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_36\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('36','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_36\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@article{hanisch25anonymization,<br \/>\r\ntitle = {Anonymization Techniques for Behavioral Biometric Data: A Survey},<br \/>\r\nauthor = {Simon Hanisch and Patricia Arias-Cabarcos and Javier Parra-Arnau and Thorsten Strufe},<br \/>\r\nurl = {https:\/\/doi.org\/10.1145\/3729418},<br \/>\r\ndoi = {10.1145\/3729418},<br \/>\r\nissn = {0360-0300},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-04-01},<br \/>\r\njournal = {ACM Comput. Surv.},<br \/>\r\npublisher = {Association for Computing Machinery},<br \/>\r\naddress = {New York, NY, USA},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {article}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('36','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_36\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"fas fa-globe\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/doi.org\/10.1145\/3729418\" title=\"https:\/\/doi.org\/10.1145\/3729418\" target=\"_blank\">https:\/\/doi.org\/10.1145\/3729418<\/a><\/li><li><i class=\"ai ai-doi\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/dx.doi.org\/10.1145\/3729418\" title=\"Follow DOI:10.1145\/3729418\" target=\"_blank\">doi:10.1145\/3729418<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('36','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_conference\"><div class=\"tp_pub_number\">19.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Schaffland, Axel;  Schaarschmidt, Marco;  Adleh, Firas;  Sch\u00f6ning, Julius<\/p><p class=\"tp_pub_title\">Urban foundation models andartificial intelligence safety <span class=\"tp_pub_type tp_  conference\">Conference<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_booktitle\">2025 IEEE 8th Forum on Research and Technologies for Society and Industry Innovation (RTSI), <\/span><span class=\"tp_pub_additional_publisher\">IEEE, <\/span><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_44\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('44','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_44\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@conference{Schaffland2025b,<br \/>\r\ntitle = {Urban foundation models andartificial intelligence safety},<br \/>\r\nauthor = {Axel Schaffland and Marco Schaarschmidt and Firas Adleh and Julius Sch\u00f6ning},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-02-01},<br \/>\r\nbooktitle = {2025 IEEE 8th Forum on Research and Technologies for Society and Industry Innovation (RTSI)},<br \/>\r\npublisher = {IEEE},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {conference}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('44','tp_bibtex')\">Close<\/a><\/p><\/div><\/div><\/div><div class=\"tp_publication tp_publication_misc\"><div class=\"tp_pub_number\">20.<\/div><div class=\"tp_pub_info\"><p class=\"tp_pub_author\"> Liebenow, Johannes;  Peinemann, Thorsten;  Mohammadi, Esfandiar<\/p><p class=\"tp_pub_title\"><a class=\"tp_title_link\" onclick=\"teachpress_pub_showhide('54','tp_links')\" style=\"cursor:pointer;\">DP-HYPE: Distributed Differentially Private Hyperparameter Search<\/a> <span class=\"tp_pub_type tp_  misc\">Miscellaneous<\/span> <\/p><p class=\"tp_pub_additional\"><span class=\"tp_pub_additional_year\">2025<\/span>.<\/p><p class=\"tp_pub_menu\"><span class=\"tp_resource_link\"><a id=\"tp_links_sh_54\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('54','tp_links')\" title=\"Show links and resources\" style=\"cursor:pointer;\">Links<\/a><\/span> | <span class=\"tp_bibtex_link\"><a id=\"tp_bibtex_sh_54\" class=\"tp_show\" onclick=\"teachpress_pub_showhide('54','tp_bibtex')\" title=\"Show BibTeX entry\" style=\"cursor:pointer;\">BibTeX<\/a><\/span><\/p><div class=\"tp_bibtex\" id=\"tp_bibtex_54\" style=\"display:none;\"><div class=\"tp_bibtex_entry\"><pre>@misc{liebenow2025dphypedistributeddifferentiallyprivate,<br \/>\r\ntitle = {DP-HYPE: Distributed Differentially Private Hyperparameter Search},<br \/>\r\nauthor = {Johannes Liebenow and Thorsten Peinemann and Esfandiar Mohammadi},<br \/>\r\nurl = {https:\/\/arxiv.org\/abs\/2510.04902},<br \/>\r\nyear  = {2025},<br \/>\r\ndate = {2025-01-01},<br \/>\r\nkeywords = {},<br \/>\r\npubstate = {published},<br \/>\r\ntppubtype = {misc}<br \/>\r\n}<br \/>\r\n<\/pre><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('54','tp_bibtex')\">Close<\/a><\/p><\/div><div class=\"tp_links\" id=\"tp_links_54\" style=\"display:none;\"><div class=\"tp_links_entry\"><ul class=\"tp_pub_list\"><li><i class=\"ai ai-arxiv\"><\/i><a class=\"tp_pub_list\" href=\"https:\/\/arxiv.org\/abs\/2510.04902\" title=\"https:\/\/arxiv.org\/abs\/2510.04902\" target=\"_blank\">https:\/\/arxiv.org\/abs\/2510.04902<\/a><\/li><\/ul><\/div><p class=\"tp_close_menu\"><a class=\"tp_close\" onclick=\"teachpress_pub_showhide('54','tp_links')\">Close<\/a><\/p><\/div><\/div><\/div><\/div><div class=\"tablenav\"><div class=\"tablenav-pages\"><span class=\"displaying-num\">63 entries<\/span> <a class=\"page-numbers button disabled\">&laquo;<\/a> <a class=\"page-numbers button disabled\">&lsaquo;<\/a> 1 of 4 <a href=\"\/index.php\/publikationen?limit=2&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"next page\" class=\"page-numbers button\">&rsaquo;<\/a> <a href=\"\/index.php\/publikationen?limit=4&amp;tgid=&amp;yr=&amp;type=&amp;usr=&amp;auth=&amp;tsr=\" title=\"last page\" class=\"page-numbers button\">&raquo;<\/a> <\/div><\/div><\/div><\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>Hier finden Sie Ver\u00f6ffentlichungen zu aktuellen Themen des Forschungsnetzwerks Anonymisierung.<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-41","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.forschungsnetzwerk-anonymisierung.de\/index.php\/wp-json\/wp\/v2\/pages\/41","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.forschungsnetzwerk-anonymisierung.de\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.forschungsnetzwerk-anonymisierung.de\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.forschungsnetzwerk-anonymisierung.de\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.forschungsnetzwerk-anonymisierung.de\/index.php\/wp-json\/wp\/v2\/comments?post=41"}],"version-history":[{"count":26,"href":"https:\/\/www.forschungsnetzwerk-anonymisierung.de\/index.php\/wp-json\/wp\/v2\/pages\/41\/revisions"}],"predecessor-version":[{"id":2866,"href":"https:\/\/www.forschungsnetzwerk-anonymisierung.de\/index.php\/wp-json\/wp\/v2\/pages\/41\/revisions\/2866"}],"wp:attachment":[{"href":"https:\/\/www.forschungsnetzwerk-anonymisierung.de\/index.php\/wp-json\/wp\/v2\/media?parent=41"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}