{"id":58,"date":"2022-11-04T16:01:31","date_gmt":"2022-11-04T07:01:31","guid":{"rendered":"https:\/\/isita.ieice.org\/2024\/recentresultsposters\/"},"modified":"2024-10-12T16:48:57","modified_gmt":"2024-10-12T07:48:57","slug":"recentresultsposters","status":"publish","type":"page","link":"https:\/\/isita.ieice.org\/2024\/recentresultsposters\/","title":{"rendered":"Recent Results Posters"},"content":{"rendered":"\r\n<p>Interested authors are invited to submit their most recent results in information theory and its applications, on topics including, but not limited to:<\/p>\r\n<table style=\"font-size: 14px; width: 98%; height: 294px;\" border=\"0\" cellspacing=\"0\" cellpadding=\"0\" align=\"center\">\r\n<tbody>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Boolean Functions and Sequences<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022 Information Inequalities<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Coding for Storage<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022 Integrated Circuit Design for Information Theory<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Coding Theory<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022 Multimedia Processing<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Communication Theory<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022 Network Coding and Information Theory<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Computation and Complexity in Information Theory<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022 Pattern Recognition and Machine Learning<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Cryptography and Information-Theoretic Security<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022 Quantum Information and Coding Theory<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Data Privacy and Security<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022 Shannon Theory<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Deep Learning in Information Theory<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022 Signal Processing<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Distributed Coding and Computation<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022 Source Coding and Data Compression<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022 Estimation and Detection<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022\u00a0Sparsity and Compressed Sensing<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022\u00a0Formalization of Information Theory<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022\u00a0Statistical Inference and Learning<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022\u00a0Group Testing<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022\u00a0Statistical Physics for Information Theory<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022\u00a0Information Hiding<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022\u00a0Statistics and Information Geometry<\/td>\r\n<\/tr>\r\n<tr style=\"height: 21px;\">\r\n<td style=\"width: 49.75616%; height: 21px;\">\u2022\u00a0Information Theory for Biology<\/td>\r\n<td style=\"width: 62.964553%; height: 21px;\">\u2022\u00a0Wireless Communications\u00a0<\/td>\r\n<\/tr>\r\n<\/tbody>\r\n<\/table>\r\n<h2><span style=\"color: #000000;\">Schedule<\/span><\/h2>\r\n<p><span style=\"font-size: 11pt;\"><strong>Submission deadline: <s> August 7, 2024, 23:59, AoE<\/s> <span style=\"color: #ff0000;\"><strong>August 14, 2024, 23:59, AoE (Extended): <br \/>The submission site is now closed.\u00a0<\/strong><\/span><\/strong><\/span><\/p>\r\n<p><strong>Acceptance notification: <\/strong><strong>\u00a0August 21, 2024<\/strong><\/p>\r\n<p>Authors who wish to present their work in the recent results poster session and to have their abstract included in the symposium proceedings should submit a one-page abstract on <a href=\"https:\/\/edas.info\/newPaper.php?c=31760&amp;track=121234\">EDAS<\/a>.<\/p>\r\n<p>Authors should use the same format as for regular ISITA papers, but with one page only. Note that a submitted abstract should be a final version; no revisions will be considered. Formatting errors may lead to rejection.<\/p>\r\n<p>The program committee will screen and approve submissions based on the relevance and the timeliness of the result. Poster abstracts will not appear in IEEE Xplore.<\/p>\r\n<h2><span style=\"color: #000000;\">For Presenters of the Poster Session<\/span><\/h2>\r\n<p>Please check &#8220;<a href=\"https:\/\/isita.ieice.org\/2024\/guidelines\/\">Guidelines for Presenters<\/a>&#8221; for details.\u00a0<\/p>\r\n<!--\r\n<p>To avoid possible congestion and untraceable people contacts in the poster displaying area, we do not have designated \u201ccore time\u201d for presenters to stand at posters. Instead, we will have \u201cposter review sessions\u201d in which presenters of posters give very short talks (five-minutes presentation each, no discussion time) on their poster contents. Therefore, a presenter is requested to prepare (1) a poster for display, and (2) a short presentation material (slides).<\/p>\r\n<p><strong><span style=\"font-size: 16px;\"><span style=\"caret-color: #000000; color: #000000; font-family: Helvetica;\">Each presenter shall prepare<\/span><\/span><\/strong><\/p>\r\n<ol>\r\n<li>a poster for display: A presenter is provided a poster board that can accommodate a A0 poster in the portrait orientation, i.e., 841-mm (width) x 1189-mm (height) or 33.11-inch (width) x 46.81-inch (height). A presenter is also requested to bring pushpins for stacking the poster.<\/li>\r\n<li>slides for a short talk: A presenter is requested to deliver a short talk for introducing the poster contents. Check the schedule of Poster Review Sessions and prepare slides and a PC for the presentation. The talk must be five-minutes or shorter, and we do not have question &amp; discussion time in the Poster Review Session.<\/li>\r\n<\/ol>\r\n-->\r\n<p>&nbsp;<\/p>\r\n<!-- \u25b2 \/\/article\/\/div[@class='field-item even'] --><!-- \u25b2 \/\/div[@id='container']\/\/div[@class='sp-content'] -->","protected":false},"excerpt":{"rendered":"<p>Interested authors are invited to submit\u2026<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/isita.ieice.org\/2024\/wp-json\/wp\/v2\/pages\/58"}],"collection":[{"href":"https:\/\/isita.ieice.org\/2024\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/isita.ieice.org\/2024\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/isita.ieice.org\/2024\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/isita.ieice.org\/2024\/wp-json\/wp\/v2\/comments?post=58"}],"version-history":[{"count":13,"href":"https:\/\/isita.ieice.org\/2024\/wp-json\/wp\/v2\/pages\/58\/revisions"}],"predecessor-version":[{"id":480,"href":"https:\/\/isita.ieice.org\/2024\/wp-json\/wp\/v2\/pages\/58\/revisions\/480"}],"wp:attachment":[{"href":"https:\/\/isita.ieice.org\/2024\/wp-json\/wp\/v2\/media?parent=58"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}