发布求助
文献互助 智能选刊 最新文献

Analysis of Experimental Algorithms - Special Event最新文献

筛选
英文 中文
Automated Deep Learning for Threat Detection in Luggage from X-Ray Images 基于x射线图像的行李威胁检测的自动深度学习
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_32
Alessio Petrozziello, I. Jordanov
{"title":"Automated Deep Learning for Threat Detection in Luggage from X-Ray Images","authors":"Alessio Petrozziello, I. Jordanov","doi":"10.1007/978-3-030-34029-2_32","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_32","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121611134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Computing Treewidth via Exact and Heuristic Lists of Minimal Separators 通过最小分隔符的精确和启发式列表计算树宽
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_15
H. Tamaki
{"title":"Computing Treewidth via Exact and Heuristic Lists of Minimal Separators","authors":"H. Tamaki","doi":"10.1007/978-3-030-34029-2_15","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_15","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115481690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Unit Disk Cover for Massive Point Sets 大规模点集的单位磁盘盖
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_10
Anirban Ghosh, Brian Hicks, Ronald Shevchenko
{"title":"Unit Disk Cover for Massive Point Sets","authors":"Anirban Ghosh, Brian Hicks, Ronald Shevchenko","doi":"10.1007/978-3-030-34029-2_10","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_10","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121841118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem 子图同构问题彩色编码算法的高效实现
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_19
J. Malík, O. Suchý, T. Valla
{"title":"Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem","authors":"J. Malík, O. Suchý, T. Valla","doi":"10.1007/978-3-030-34029-2_19","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_19","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123133313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Machine Learning Framework for Volume Prediction 体积预测的机器学习框架
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-24 DOI: 10.1007/978-3-030-34029-2_27
Umutcan Önal, Zafeirakis Zafeirakopoulos
{"title":"A Machine Learning Framework for Volume Prediction","authors":"Umutcan Önal, Zafeirakis Zafeirakopoulos","doi":"10.1007/978-3-030-34029-2_27","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_27","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121863728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fast Public Transit Routing with Unrestricted Walking through Hub Labeling 快速公共交通路线与不受限制的步行通过枢纽标签
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-06-21 DOI: 10.1007/978-3-030-34029-2_16
Duc-Minh Phan, L. Viennot
{"title":"Fast Public Transit Routing with Unrestricted Walking through Hub Labeling","authors":"Duc-Minh Phan, L. Viennot","doi":"10.1007/978-3-030-34029-2_16","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_16","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121009862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Voronoi diagram of orthogonal polyhedra in two and three dimensions 二维和三维正交多面体的Voronoi图
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-05-21 DOI: 10.1007/978-3-030-34029-2_1
I. Emiris, Christina Katsamaki
{"title":"Voronoi diagram of orthogonal polyhedra in two and three dimensions","authors":"I. Emiris, Christina Katsamaki","doi":"10.1007/978-3-030-34029-2_1","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_1","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"208 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121046000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model 恒定工作空间模型测地线最短路径算法的实验研究
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-04-05 DOI: 10.1007/978-3-030-34029-2_21
Jonas Cleve, Wolfgang Mulzer
{"title":"An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model","authors":"Jonas Cleve, Wolfgang Mulzer","doi":"10.1007/978-3-030-34029-2_21","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_21","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116273958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Approximation algorithms and an integer program for multi-level graph spanners 近似算法和整数程序的多层次图形扳手
Analysis of Experimental Algorithms - Special Event Pub Date : 2019-04-01 DOI: 10.1007/978-3-030-34029-2_35
Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, S. Kobourov, F. Sahneh, Richard Spence
{"title":"Approximation algorithms and an integer program for multi-level graph spanners","authors":"Abu Reyan Ahmed, Keaton Hamm, Mohammad Javad Latifi Jebelli, S. Kobourov, F. Sahneh, Richard Spence","doi":"10.1007/978-3-030-34029-2_35","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_35","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114040148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Effective Heuristics for Matchings in Hypergraphs 超图匹配的有效启发式算法
Analysis of Experimental Algorithms - Special Event Pub Date : 2018-11-01 DOI: 10.1007/978-3-030-34029-2_17
F. Dufossé, K. Kaya, Ioannis Panagiotas, B. Uçar
{"title":"Effective Heuristics for Matchings in Hypergraphs","authors":"F. Dufossé, K. Kaya, Ioannis Panagiotas, B. Uçar","doi":"10.1007/978-3-030-34029-2_17","DOIUrl":"https://doi.org/10.1007/978-3-030-34029-2_17","url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"30 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115931417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信