

{"id":69,"date":"2022-01-21T13:03:18","date_gmt":"2022-01-21T12:03:18","guid":{"rendered":"https:\/\/project.inria.fr\/answer\/?page_id=69"},"modified":"2022-01-21T13:13:49","modified_gmt":"2022-01-21T12:13:49","slug":"publication","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/answer\/publication\/","title":{"rendered":"Publication"},"content":{"rendered":"<ul>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[1] Coline Boniface, Imane Fouad, Nataliia Bielova, C\u00e9dric Lauradoux, Cristiana Santos. Security Analysis of Subject Access Request Procedures How to authenticate data subjects safely when they request for their data. <i>APF 2019 \u2013 Annual Privacy Forum<\/i>, Jun 2019, Rome, Italy. pp.1\u201320. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-02072302\">https:\/\/hal.inria.fr\/<strong>h<\/strong><b>al-<\/b><b>02072302<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[2] Konstantin Avrachenkov, Vivek Borkar. A learning algorithm for the Whittle index policy for scheduling web crawlers. <i>Allerton 2019 \u2013 57th Annual Conference on Communication, Control, and Computing<\/i>, Sep 2019, Monticello, France. pp.1001\u20131006, &lt;10.1109\/ALLERTON.2019.8919743&gt;. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-02416599\">https:\/\/hal.inria.fr\/<b>hal-02416599<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[3] Estelle Maudet, Christophe Servan. Conception d\u2019un syst\u00e8me de d\u00e9tection d\u2019intention pour un moteur de recherche sur Internet. <i>6e conf\u00e9rence conjointe Journ\u00e9es d\u2019\u00c9tudes sur la Parole (JEP, 33e \u00e9dition), Traitement Automatique des Langues Naturelles (TALN, 27e \u00e9dition), Rencontre des \u00c9tudiants Chercheurs en Informatique pour le Traitement Automatique des Langues (R\u00c9CITAL, 22e \u00e9dition). Volume 4 : D\u00e9monstrations et r\u00e9sum\u00e9s d\u2019articles internationaux<\/i>, Jun 2020, Nancy, France. pp.50\u201352. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-02768512\">https:\/\/hal.inria.fr\/<b>hal-02768512<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[4] Konstantin Avrachenkov, Vivek Borkar, Harsh Dolhare, Kishor Patil. Full Gradient DQN Reinforcement Learning: A Provably Convergent Scheme. Alexey Piunovskiy; Yi Zhang. <i>Modern Trends in Controlled Stochastic Processes: Theory and Applications, V.III<\/i>, 41, Springer International Publishing, pp.192\u2013220, 2021, Emergence, Complexity and Computation, 978\u20133\u2013030\u201376928\u20134. &lt;10.1007\/978\u20133\u2013030\u201376928\u20134_10&gt;. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03462350\">https:\/\/hal.inria.fr\/<b>hal-03462350<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[5] Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe. Change Rate Estimation and Optimal Freshness in Web Page Crawling. <i>VALUETOOLS 2020 \u2013 13th EAI International Conference on Performance Evaluation Methodologies and Tools<\/i>, May 2020, Tsukuba, Japan. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03123809\">https:\/\/hal.inria.fr\/<b>hal-03123809<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[6] Konstantin Avrachenkov, Vivek Borkar, Kishor Patil. Deep Reinforcement Learning for Web Crawling. <i>The Seventh Indian Control Conference 2021<\/i>, Dec 2021, Mumbai, India. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03461189\">https:\/\/hal.inria.fr\/<b>hal-03461189<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[7] Doli\u00e8re Francis Som\u00e9, Tamara Rezk. Strenghtening Content Security Policy via Monitoring and URL Parameters Filtering. <i>WPES&#8217;20: Proceedings of the 19th Workshop on Privacy in the Electronic Society CCS &#8217;20: 2020 ACM SIGSAC Conference on Computer and Communications Security<\/i>, Nov 2020, Virtual Event USA, France. pp.1\u201313, &lt;10.1145\/3411497.3420222&gt;. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03141393\">https:\/\/hal.inria.fr\/<b>hal-03141393<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[8] Imane Fouad, Nataliia Bielova, Arnaud Legout, Natasa Sarafijanovic\u2013Djukic. Missed by Filter Lists: Detecting Unknown Third\u2013Party Trackers with Invisible Pixels. <i>PETS 2020 \u2013 20th Privacy Enhancing Technologies Symposium<\/i>, Jul 2020, Montr\u00e9al, Canada. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-01943496\">https:\/\/hal.inria.fr\/<b>hal-01943496<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[9] Vorakit Vorakitphan, Marco Guerini, Elena Cabrio, Serena Villata. Regrexit or not Regrexit: Aspect\u2013based Sentiment Analysis in Polarized Contexts. <i>COLING&#8217;2020 \u2013 28th International Conference on Computational Linguistics (COLING&#8217;2020)<\/i>, Dec 2020, Barcelona \/ Online, Spain. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03031812\">https:\/\/hal.inria.fr\/<b>hal-03031812<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[10] Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe. Online algorithms for estimating change rates of web pages. <i>Performance Evaluation<\/i>, <i>Elsevier<\/i>, 2021, SI: ValueTools 2020, 153, &lt;10.1016\/j.peva.2021.102261&gt;. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03461575\">https:\/\/hal.inria.fr\/<b>hal-03461575<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[11] Vorakit Vorakitphan, Elena Cabrio, Serena Villata. \u201dDon&#8217;t discuss\u201d: Investigating Semantic and Argumentative Features for Supervised Propagandist Message Detection and Classification. <i>RANLP 2021 \u2013 Recent Advances in Natural Language Processing<\/i>, Sep 2021, Varna \/ Virtual, Bulgaria. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03314797\">https:\/\/hal.inria.fr\/<b>hal-03314797<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[12] Vorakit Vorakitphan, Elena Cabrio, Serena Villata. PROTECT \u2013 A Pipeline for Propaganda Detection and Classification. <i>Eighth Italian Conference on Computational Linguistics (CLIC\u2013it 2021)<\/i>, Jan 2022, Milan, Italy. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03417019\">https:\/\/hal.inria.fr\/<b>hal-03417019<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[13] Hai Huang, Fabien Gandon. Learning URI Selection Criteria to Improve the Crawling of Linked Open Data. <i>ESWC2019 \u2013 16th Extended Semantic Web Conference<\/i>, Jun 2019, Portoroz, Slovenia. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-02073854\">https:\/\/hal.inria.fr\/<b>hal-02073854<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[14] Hai Huang, Fabien Gandon. Learning URI Selection Criteria to Improve the Crawling of Linked Open Data (Extended Abstract). <i>IJCAI 2020 \u2013 29th International Joint Conference on Artificial Intelligence<\/i>, Jan 2021, Yokohama, Japan. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03064912\">https:\/\/hal.inria.fr\/<b>hal-03064912<\/b><\/a>&gt;<\/span><\/span><\/li>\n<li><span style=\"font-family: Times New Roman, serif;\"><span style=\"font-size: small;\">[15] Anna Bobasheva, Fabien Gandon, Fr\u00e9d\u00e9ric Precioso. Learning and Reasoning for Cultural Metadata Quality. <i>Journal on Computing and Cultural Heritage<\/i>, <i>Association for Computing Machinery<\/i>, In press. &lt;<a href=\"https:\/\/hal.inria.fr\/hal-03363442\">https:\/\/hal.inria.fr\/<b>hal-03363442<\/b><\/a>&gt;<\/span><\/span><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>[1] Coline Boniface, Imane Fouad, Nataliia Bielova, C\u00e9dric Lauradoux, Cristiana Santos. Security Analysis of Subject Access Request Procedures How to authenticate data subjects safely when they request for their data. APF 2019 \u2013 Annual Privacy Forum, Jun 2019, Rome, Italy. pp.1\u201320. &lt;https:\/\/hal.inria.fr\/hal-02072302&gt; [2] Konstantin Avrachenkov, Vivek Borkar. A learning algorithm\u2026<\/p>\n<p> <a class=\"continue-reading-link\" href=\"https:\/\/project.inria.fr\/answer\/publication\/\"><span>Continue reading<\/span><i class=\"crycon-right-dir\"><\/i><\/a> <\/p>\n","protected":false},"author":416,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-69","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/answer\/wp-json\/wp\/v2\/pages\/69","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/answer\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/answer\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/answer\/wp-json\/wp\/v2\/users\/416"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/answer\/wp-json\/wp\/v2\/comments?post=69"}],"version-history":[{"count":4,"href":"https:\/\/project.inria.fr\/answer\/wp-json\/wp\/v2\/pages\/69\/revisions"}],"predecessor-version":[{"id":74,"href":"https:\/\/project.inria.fr\/answer\/wp-json\/wp\/v2\/pages\/69\/revisions\/74"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/answer\/wp-json\/wp\/v2\/media?parent=69"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}