{"id":191,"date":"2017-12-22T14:34:47","date_gmt":"2017-12-22T17:34:47","guid":{"rendered":"http:\/\/www4.sbc.org.br\/csbc2018\/?page_id=191"},"modified":"2018-06-05T19:54:20","modified_gmt":"2018-06-05T22:54:20","slug":"ctd","status":"publish","type":"page","link":"https:\/\/www4.sbc.org.br\/csbc2018\/?page_id=191","title":{"rendered":"31\u00ba CTD"},"content":{"rendered":"<h1><span style=\"color: #519660;\"><strong>31\u00ba Concurso de Teses e Disserta\u00e7\u00f5es (CTD)<br \/>\n<\/strong><\/span><\/h1>\n<p>&nbsp;<\/p>\n<h2><span style=\"color: #519660;\"><strong>Datas importantes<\/strong><\/span><\/h2>\n<p>&#8211; Registro dos trabalhos: <strong>23\/02\/2018 (23:55 de Bras\u00edlia) <\/strong><br \/>\n&#8211; Submiss\u00e3o dos trabalhos: <strong>28\/02\/2018 (23:55 de Bras\u00edlia) <\/strong><br \/>\n&#8211; Notifica\u00e7\u00e3o dos melhores trabalhos: <strong><del>23\/04\/2018<\/del> 27\/04\/2018<\/strong><br \/>\n&#8211; Envio da vers\u00e3o final dos trabalhos: <strong>30\/04\/2018 <\/strong><\/p>\n<h2><span style=\"color: #519660;\"><strong>Sobre o evento<\/strong><\/span><\/h2>\n<p align=\"justify\">O CTD selecionar\u00e1 e premiar\u00e1 as melhores Teses de Doutorado e Disserta\u00e7\u00f5es de Mestrado da \u00e1rea de Computa\u00e7\u00e3o do pa\u00eds conclu\u00eddas, defendidas e aprovadas, no per\u00edodo de 1o de janeiro a 31 de dezembro de 2017. As teses e disserta\u00e7\u00f5es que concorrerem nesta edi\u00e7\u00e3o ser\u00e3o avaliadas de acordo com os resultados cient\u00edficos e tecnol\u00f3gicos j\u00e1 gerados pelo trabalho, assim como pelo seu potencial de impacto na sociedade e no estado da arte na \u00e1rea de Computa\u00e7\u00e3o. Assim, convidamos os interessados a submeterem seus trabalhos para o CTD 2018.<\/p>\n<p>Dentre os trabalhos que cumprirem os requisitos estabelecidos, ser\u00e3o premiadas at\u00e9 tr\u00eas Teses de Doutorado e tr\u00eas Disserta\u00e7\u00f5es de Mestrado. Os pr\u00eamios ser\u00e3o entregues na cerim\u00f4nia de premia\u00e7\u00e3o durante o CSBC. O(s) autor(es) da(s) melhor(es) Tese(s) de Doutorado premiada(s) no CSBC ser\u00e3o convidados a publicar uma vers\u00e3o em ingl\u00eas da Tese (devidamente adaptada) como um livro com a Springer.<\/p>\n<p>Para mais detalhes, veja a chamada completa em <a href=\"http:\/\/www4.sbc.org.br\/csbc2018\/wp-content\/uploads\/2018\/04\/CTD.pdf\" target=\"_blank\" rel=\"noopener\">PDF<\/a>.<\/p>\n<div class=\"section_title\"><\/div>\n<div>\n<h2><strong><span style=\"color: #339966;\">Programa\u00e7\u00e3o dos Trabalhos Selecionados para Apresenta\u00e7\u00e3o Oral<\/span><\/strong><\/h2>\n<div>\n<h4><span style=\"color: #339966;\"><strong>Sess\u00e3o 1 \u0096 SEG 10h\u009613h<\/strong><\/span><\/h4>\n<\/div>\n<div>\n<h5><span style=\"color: #339966;\"><strong>Disserta\u00e7\u00f5es de Mestrado<\/strong><\/span><\/h5>\n<\/div>\n<ul>\n<li><strong><em>PDAC: Um Protocolo de Aloca\u00e7\u00e3o Din\u00e2mica de Canais para Ambientes M\u00e9dicos<\/em><\/strong><br \/>\nUFJF \u0096 Bruno Cremonezi; Alex Vieira; Michele Nogueira<\/li>\n<li><strong><em>Stacking Bagged and Boosted Forests for Classification of Noisy and High-Dimensional Data<\/em><\/strong><br \/>\nUFMG \u0096 Raphael Campos; Marcos Gon\u00e7alves<\/li>\n<li><strong><em>Probabilistic data structures applied to implicit graph representation<\/em><\/strong><br \/>\nUERJ \u0096 Juan Lopes; Fabiano Oliveira; Paulo Pinto<\/li>\n<li><strong><em>Understanding and Automating Application-level Caching<\/em><\/strong><br \/>\nUFRGS \u0096 Jhonny Mertz; Ingrid Nunes<\/li>\n<li><strong><em>Conex\u00e3o de terminais com limita\u00e7\u00e3o de roteadores: complexidade e rela\u00e7\u00e3o com fluxos e caminhos disjuntos<\/em><\/strong><br \/>\nCOPPE\/UFRJ \u0096 Alexsander Melo; Celina Miraglia Herrera de Figueiredo; U\u00e9verton dos Santos Souza<\/li>\n<li><strong><em>Uma Nova Solu\u00e7\u00e3o para Visibility Culling de Cenas Gen\u00e9ricas, baseada em Replica\u00e7\u00e3o, Heur\u00edsticas e Redu\u00e7\u00e3o de Draw Calls<\/em><\/strong><br \/>\nUNIFOR \u0096 Yvens Rebou\u00e7as Serpa; Maria Andr\u00e9ia Formico Rodrigues<\/li>\n<\/ul>\n<div>\n<h4><\/h4>\n<h4><span style=\"color: #339966;\"><strong>Sess\u00e3o 2 \u0096 SEG 17h\u009620h<\/strong><\/span><\/h4>\n<\/div>\n<div>\n<h5><span style=\"color: #339966;\"><strong>Disserta\u00e7\u00f5es de Mestrado<\/strong><\/span><\/h5>\n<\/div>\n<ul>\n<li><strong><em>Evaluating I\/O Scheduling Techniques at the Forwarding Layer and Coordinating Data Server Accesses<\/em><\/strong><br \/>\nUFRGS \u0096 Jean Luca Bez; Philippe Olivier Alexandre Navaux<\/li>\n<li><strong><em>The similarity-aware relational division database operator<\/em><\/strong><br \/>\nUSP\/S\u00e3o Carlos \u0096 Andr\u00e9 dos Santos Gonzaga; Robson Cordeiro<\/li>\n<li><strong><em>Machine Learning for Incomplete Data<\/em><\/strong><br \/>\nUFC \u0096 Diego Mesquita; Jo\u00e3o Paulo Pordeus Gomes<\/li>\n<\/ul>\n<\/div>\n<div><\/div>\n<div>\n<h5><\/h5>\n<h5><span style=\"color: #339966;\"><strong>Teses de Doutorado<\/strong><\/span><\/h5>\n<\/div>\n<div>\n<ul>\n<li><strong><em>Generation of semantic layouts for interactive multidimensional data visualization<\/em><\/strong><br \/>\nUSP\/S\u00e3o Carlos \u0096 Erick Gomez Nieto; Luis Gustavo Nonato<\/li>\n<li><strong><em>Engineering Augmented Suffix Sorting Algorithms<\/em><\/strong><br \/>\nUNICAMP \u0096 Felipe Alves da Louza; Guilherme Pimentel Telles; Simon Gog<\/li>\n<li><strong><em>The use of heterogeneous geospatial big data for improving decision-making<\/em><\/strong><br \/>\nUSP\/S\u00e3o Carlos \u0096 Flavio Eduardo Aoki Horita; Jo\u00e3o Porto de Albuquerque Pereira<\/li>\n<\/ul>\n<div>\n<h4><\/h4>\n<h4><span style=\"color: #339966;\"><strong>Sess\u00e3o 3 \u0096 TER 10h\u009613h<\/strong><\/span><\/h4>\n<\/div>\n<div>\n<h5><span style=\"color: #339966;\"><strong>Teses de Doutorado<\/strong><\/span><\/h5>\n<\/div>\n<\/div>\n<div>\n<ul>\n<li><strong><em>Graph colorings and digraph subdivisions<\/em><\/strong><br \/>\nIME\/USP \u0096 Phablo Moura; Yoshiko Wakabayashi<\/li>\n<li><strong><em>Large-Scale Similarity-Based Time Series Mining<\/em><\/strong><br \/>\nUSP\/S\u00e3o Carlos \u0096 Diego Silva; Gustavo Batista; Eamonn Keogh<\/li>\n<li><strong><em>Approximation Algorithms for Decision Trees<\/em><\/strong><br \/>\nPUC-Rio \u0096 Aline Saettler; Eduardo Laber<\/li>\n<li><strong><em>Biometrics in a data stream context<\/em><\/strong><br \/>\nUSP\/S\u00e3o Carlos \u0096 Paulo Henrique Pisani; Andr\u00e9 Carlos Ponce de Leon Ferreira de Carvalho<\/li>\n<li><strong><em>Topology Control and Opportunistic Routing for Underwater Acoustic Sensor Networks<\/em><\/strong><br \/>\nUFMG \u0096 Rodolfo Wanderson Lima Coutinho; Azzedine Boukerche; Luiz Filipe Menezes Vieira; Antonio Alfredo Ferreira Loureiro<\/li>\n<li><strong><em>Scalable Cost-Efficient Placement and Chaining of Virtual Network Functions<\/em><\/strong><br \/>\nUFRGS \u0096 Marcelo Caggiani Luizelli; Luciana Buriol; Luciano Paschoal Gaspary<\/li>\n<\/ul>\n<\/div>\n<p>&nbsp;<\/p>\n<div class=\"subsection_title\">\n<h2><span style=\"color: #519660;\"><strong>Coordena\u00e7\u00e3o<\/strong><\/span><\/h2>\n<\/div>\n<table style=\"height: 210 px;\" width=\"460\">\n<tbody>\n<tr>\n<td><\/td>\n<td>\n<ul>\n<li>Simone Diniz Junqueira Barbosa<\/li>\n<li>PUC-Rio<\/li>\n<li>Coordena\u00e7\u00e3o Geral<\/li>\n<li>e-mail:\u00a0<u>ctd.csbc2018@gmail.com<\/u><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<tr>\n<td><span style=\"color: #ffffff;\">&#8230;<\/span><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td>\n<ul>\n<li>Uir\u00e1 Kulesza<\/li>\n<li>DIMAp\/UFRN<\/li>\n<li>Coordena\u00e7\u00e3o Local<\/li>\n<li>e-mail:\u00a0<u>ctd.csbc2018@gmail.com<\/u><\/li>\n<\/ul>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>31\u00ba Concurso de Teses e Disserta\u00e7\u00f5es (CTD) &nbsp; Datas importantes &#8211; Registro dos trabalhos: 23\/02\/2018 (23:55 de Bras\u00edlia) &#8211; Submiss\u00e3o dos trabalhos: 28\/02\/2018 (23:55 de Bras\u00edlia) &#8211; Notifica\u00e7\u00e3o dos melhores &#8230;<\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"content-fullwidth.php","meta":{"footnotes":""},"class_list":["post-191","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www4.sbc.org.br\/csbc2018\/index.php?rest_route=\/wp\/v2\/pages\/191","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www4.sbc.org.br\/csbc2018\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www4.sbc.org.br\/csbc2018\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www4.sbc.org.br\/csbc2018\/index.php?rest_route=\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www4.sbc.org.br\/csbc2018\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=191"}],"version-history":[{"count":20,"href":"https:\/\/www4.sbc.org.br\/csbc2018\/index.php?rest_route=\/wp\/v2\/pages\/191\/revisions"}],"predecessor-version":[{"id":1132,"href":"https:\/\/www4.sbc.org.br\/csbc2018\/index.php?rest_route=\/wp\/v2\/pages\/191\/revisions\/1132"}],"wp:attachment":[{"href":"https:\/\/www4.sbc.org.br\/csbc2018\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=191"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}