Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Antoine Bossard
@article{DBLP:journals/computers/Bossard23, author = {Antoine Bossard}, title = {Torus-Connected Toroids: An Efficient Topology for Interconnection Networks}, journal = {Comput.}, volume = {12}, number = {9}, pages = {173}, year = {2023}, url = {https://doi.org/10.3390/computers12090173}, doi = {10.3390/COMPUTERS12090173}, timestamp = {Sat, 13 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/computers/Bossard23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ieiceta/BossardKH23, author = {Antoine Bossard and Keiichi Kaneko and Frederick C. Harris Jr.}, title = {On the Crossing Number of a Torus Network}, journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.}, volume = {106}, number = {1}, pages = {35--44}, year = {2023}, url = {https://doi.org/10.1587/transfun.2021eap1144}, doi = {10.1587/TRANSFUN.2021EAP1144}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ieiceta/BossardKH23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jsw/Bossard23, author = {Antoine Bossard}, title = {On Modern User Interface Development and the Case of Android Applications}, journal = {J. Softw.}, volume = {18}, number = {4}, pages = {209--217}, year = {2023}, url = {https://doi.org/10.17706/jsw.18.4.209-217}, doi = {10.17706/JSW.18.4.209-217}, timestamp = {Mon, 13 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jsw/Bossard23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/access/KanekoBH22, author = {Keiichi Kaneko and Antoine Bossard and Frederick C. Harris Jr.}, title = {Set-to-Set Disjoint Path Routing in Bijective Connection Graphs}, journal = {{IEEE} Access}, volume = {10}, pages = {72731--72742}, year = {2022}, url = {https://doi.org/10.1109/ACCESS.2022.3188783}, doi = {10.1109/ACCESS.2022.3188783}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/access/KanekoBH22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bjmc/Bossard22, author = {Antoine Bossard}, title = {On the Automatised Generation of a Japanese Banduke Table}, journal = {Balt. J. Mod. Comput.}, volume = {10}, number = {4}, year = {2022}, url = {https://doi.org/10.22364/bjmc.2022.10.4.04}, doi = {10.22364/BJMC.2022.10.4.04}, timestamp = {Thu, 05 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bjmc/Bossard22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijsinnov/Bossard22, author = {Antoine Bossard}, title = {The {SOF} Programming Paradigm: {A} Sequence of Pure Functions}, journal = {Int. J. Softw. Innov.}, volume = {10}, number = {1}, pages = {1--14}, year = {2022}, url = {https://doi.org/10.4018/ijsi.309965}, doi = {10.4018/IJSI.309965}, timestamp = {Wed, 17 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijsinnov/Bossard22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/balt/Bossard22, author = {Antoine Bossard}, editor = {Mirjana Ivanovic and Marite Kirikova and Laila Niedrite}, title = {On the Automatisation of the Realisation of a Banduke Table}, booktitle = {Digital Business and Intelligent Systems - 15th International Baltic Conference, Baltic DB{\&}IS 2022, Riga, Latvia, July 4-6, 2022, Proceedings}, series = {Communications in Computer and Information Science}, volume = {1598}, pages = {80--92}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-09850-5\_6}, doi = {10.1007/978-3-031-09850-5\_6}, timestamp = {Mon, 25 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/balt/Bossard22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icccm/Bossard22, author = {Antoine Bossard}, title = {Topological properties of a 2-dimensional torus-connected cycles network}, booktitle = {Proceedings of the 10th International Conference on Computer and Communications Management, {ICCCM} 2022, Okayama, Japan, July 29-31, 2022}, pages = {139--144}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3556223.3556244}, doi = {10.1145/3556223.3556244}, timestamp = {Wed, 26 Oct 2022 15:33:28 +0200}, biburl = {https://dblp.org/rec/conf/icccm/Bossard22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/wicomm/Bossard21, author = {Antoine Bossard}, title = {On Solving the Decycling Problem in a Torus Network}, journal = {Wirel. Commun. Mob. Comput.}, volume = {2021}, pages = {5598173:1--5598173:6}, year = {2021}, url = {https://doi.org/10.1155/2021/5598173}, doi = {10.1155/2021/5598173}, timestamp = {Sun, 16 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/wicomm/Bossard21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ACISicis/Bossard21, author = {Antoine Bossard}, title = {On the Erd{\H{o}}s-S{\'{o}}s Conjecture for Stars, Paths and Some of Their Variants}, booktitle = {19th {IEEE/ACIS} International Conference on Computer and Information Science, {ICIS} 2021, Shanghai, China, June 23-25, 2021}, pages = {49--53}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.1109/ICIS51600.2021.9516866}, doi = {10.1109/ICIS51600.2021.9516866}, timestamp = {Mon, 30 Aug 2021 16:30:29 +0200}, biburl = {https://dblp.org/rec/conf/ACISicis/Bossard21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/worldcist/Bossard21, author = {Antoine Bossard}, editor = {{\'{A}}lvaro Rocha and Hojjat Adeli and Gintautas Dzemyda and Fernando Moreira and Ana Maria Ramalho Correia}, title = {On Bridging the Gap Between Far Eastern Cultures and the User Interface}, booktitle = {Trends and Applications in Information Systems and Technologies - Volume 1, WorldCIST 2021, Terceira Island, Azores, Portugal, 30 March - 2 April, 2021}, series = {Advances in Intelligent Systems and Computing}, volume = {1365}, pages = {415--424}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-72657-7\_40}, doi = {10.1007/978-3-030-72657-7\_40}, timestamp = {Sun, 16 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/worldcist/Bossard21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sensors/BossardK20, author = {Antoine Bossard and Keiichi Kaneko}, title = {Cluster-Fault Tolerant Routing in a Torus}, journal = {Sensors}, volume = {20}, number = {11}, pages = {3286}, year = {2020}, url = {https://doi.org/10.3390/s20113286}, doi = {10.3390/S20113286}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sensors/BossardK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/paap/Bossard20, author = {Antoine Bossard}, editor = {Li Ning and Vincent Chau and Francis C. M. Lau}, title = {On the Decycling Problem in a Torus}, booktitle = {Parallel Architectures, Algorithms and Programming - 11th International Symposium, {PAAP} 2020, Shenzhen, China, December 28-30, 2020, Proceedings}, series = {Communications in Computer and Information Science}, volume = {1362}, pages = {12--21}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-981-16-0010-4\_2}, doi = {10.1007/978-981-16-0010-4\_2}, timestamp = {Tue, 02 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/paap/Bossard20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cata/BossardK19, author = {Antoine Bossard and Keiichi Kaneko}, editor = {Gordon Lee and Ying Jin}, title = {Refining the Unrestricted Character Encoding for Japanese}, booktitle = {Proceedings of 34th International Conference on Computers and Their Applications, {CATA} 2019, Honolulu, Hawaii, USA, March 18-20, 2019}, series = {EPiC Series in Computing}, volume = {58}, pages = {292--300}, publisher = {EasyChair}, year = {2019}, url = {https://doi.org/10.29007/wskt}, doi = {10.29007/WSKT}, timestamp = {Sun, 15 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cata/BossardK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ism/BossardK19, author = {Antoine Bossard and Keiichi Kaneko}, title = {{UCEJ} Database Refinement and Applicability Proof}, booktitle = {{IEEE} International Symposium on Multimedia, {ISM} 2019, San Diego, CA, USA, December 9-11, 2019}, pages = {64--71}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/ISM46123.2019.00018}, doi = {10.1109/ISM46123.2019.00018}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ism/BossardK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigite/BossardK19, author = {Antoine Bossard and Keiichi Kaneko}, editor = {Bryan S. Goda and Steve Zilora and George Grispos and Daniel S. Bogaard}, title = {A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms}, booktitle = {Proceedings of the 20th Annual {SIG} Conference on Information Technology Education, {SIGITE} 2019, Tacoma, WA, USA, October 3-5, 2019}, pages = {63--68}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3349266.3351408}, doi = {10.1145/3349266.3351408}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigite/BossardK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sensors/BossardK18, author = {Antoine Bossard and Keiichi Kaneko}, title = {Torus Pairwise Disjoint-Path Routing}, journal = {Sensors}, volume = {18}, number = {11}, pages = {3912}, year = {2018}, url = {https://doi.org/10.3390/s18113912}, doi = {10.3390/S18113912}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/sensors/BossardK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/balt/BossardK18a, author = {Antoine Bossard and Keiichi Kaneko}, editor = {Audrone Lupeikiene and Olegas Vasilecas and Gintautas Dzemyda}, title = {Unrestricted Character Encoding for Japanese}, booktitle = {Databases and Information Systems {X} - Selected Papers from the Thirteenth International Baltic Conference, DB{\&}IS 2018, Trakai, Lithuania, July 1-4, 2018}, series = {Frontiers in Artificial Intelligence and Applications}, volume = {315}, pages = {161--175}, publisher = {{IOS} Press}, year = {2018}, url = {https://doi.org/10.3233/978-1-61499-941-6-161}, doi = {10.3233/978-1-61499-941-6-161}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/balt/BossardK18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/balt/BossardK18, author = {Antoine Bossard and Keiichi Kaneko}, editor = {Audrone Lupeikiene and Olegas Vasilecas and Gintautas Dzemyda}, title = {Proposal of an Unrestricted Character Encoding for Japanese}, booktitle = {Databases and Information Systems - 13th International Baltic Conference, DB{\&}IS 2018, Trakai, Lithuania, July 1-4, 2018, Proceedings}, series = {Communications in Computer and Information Science}, volume = {838}, pages = {189--201}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-97571-9\_16}, doi = {10.1007/978-3-319-97571-9\_16}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/balt/BossardK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ithings/BossardK18, author = {Antoine Bossard and Keiichi Kaneko}, title = {On the Torus Pairwise Disjoint-Path Routing Problem}, booktitle = {{IEEE} International Conference on Internet of Things (iThings) and {IEEE} Green Computing and Communications (GreenCom) and {IEEE} Cyber, Physical and Social Computing (CPSCom) and {IEEE} Smart Data (SmartData), iThings/GreenCom/CPSCom/SmartData 2018, Halifax, NS, Canada, July 30 - August 3, 2018}, pages = {1739--1746}, publisher = {{IEEE}}, year = {2018}, url = {https://doi.org/10.1109/Cybermatics\_2018.2018.00290}, doi = {10.1109/CYBERMATICS\_2018.2018.00290}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ithings/BossardK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijnc/KanekoB17, author = {Keiichi Kaneko and Antoine Bossard}, title = {A Set-to-Set Disjoint Paths Routing Algorithm in Tori}, journal = {Int. J. Netw. Comput.}, volume = {7}, number = {2}, pages = {173--186}, year = {2017}, url = {http://www.ijnc.org/index.php/ijnc/article/view/149}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ijnc/KanekoB17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ica3pp/Bossard17, author = {Antoine Bossard}, editor = {Shadi Ibrahim and Kim{-}Kwang Raymond Choo and Zheng Yan and Witold Pedrycz}, title = {High-Performance Graphics in Racket with DirectX}, booktitle = {Algorithms and Architectures for Parallel Processing - 17th International Conference, {ICA3PP} 2017, Helsinki, Finland, August 21-23, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10393}, pages = {814--825}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-65482-9\_66}, doi = {10.1007/978-3-319-65482-9\_66}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/ica3pp/Bossard17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iccS/Bossard17, author = {Antoine Bossard}, editor = {Petros Koumoutsakos and Michael Lees and Valeria V. Krzhizhanovskaya and Jack J. Dongarra and Peter M. A. Sloot}, title = {Automatic Segmentation of Chinese Characters as Wire-Frame Models}, booktitle = {International Conference on Computational Science, {ICCS} 2017, 12-14 June 2017, Zurich, Switzerland}, series = {Procedia Computer Science}, volume = {108}, pages = {415--424}, publisher = {Elsevier}, year = {2017}, url = {https://doi.org/10.1016/j.procs.2017.05.122}, doi = {10.1016/J.PROCS.2017.05.122}, timestamp = {Thu, 08 Jul 2021 16:04:01 +0200}, biburl = {https://dblp.org/rec/conf/iccS/Bossard17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ieicet/BossardK16, author = {Antoine Bossard and Keiichi Kaneko}, title = {Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles}, journal = {{IEICE} Trans. Inf. Syst.}, volume = {99-D}, number = {11}, pages = {2821--2823}, year = {2016}, url = {https://doi.org/10.1587/transinf.2016EDL8099}, doi = {10.1587/TRANSINF.2016EDL8099}, timestamp = {Sat, 11 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ieicet/BossardK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ic-nc/KanekoB16, author = {Keiichi Kaneko and Antoine Bossard}, title = {Set-to-Set Disjoint Paths in Tori}, booktitle = {Fourth International Symposium on Computing and Networking, {CANDAR} 2016, Hiroshima, Japan, November 22-25, 2016}, pages = {91--97}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/CANDAR.2016.0028}, doi = {10.1109/CANDAR.2016.0028}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ic-nc/KanekoB16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amcs/BossardK15, author = {Antoine Bossard and Keiichi Kaneko}, title = {Torus-Connected Cycles: {A} Simple And Scalable Topology For Interconnection Networks}, journal = {Int. J. Appl. Math. Comput. Sci.}, volume = {25}, number = {4}, pages = {723--735}, year = {2015}, url = {https://doi.org/10.1515/amcs-2015-0052}, doi = {10.1515/AMCS-2015-0052}, timestamp = {Mon, 26 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amcs/BossardK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijhpcn/BossardKP15, author = {Antoine Bossard and Keiichi Kaneko and Shietung Peng}, title = {Node-to-set disjoint paths routing in a metacube}, journal = {Int. J. High Perform. Comput. Netw.}, volume = {8}, number = {4}, pages = {315--323}, year = {2015}, url = {https://doi.org/10.1504/IJHPCN.2015.072778}, doi = {10.1504/IJHPCN.2015.072778}, timestamp = {Thu, 09 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijhpcn/BossardKP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijnc/BossardK15, author = {Antoine Bossard and Keiichi Kaneko}, title = {Hypercube Fault Tolerant Routing with Bit Constraint}, journal = {Int. J. Netw. Comput.}, volume = {5}, number = {2}, pages = {272--289}, year = {2015}, url = {http://www.ijnc.org/index.php/ijnc/article/view/108}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ijnc/BossardK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijndc/BossardK15, author = {Antoine Bossard and Keiichi Kaneko}, title = {A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint}, journal = {Int. J. Networked Distributed Comput.}, volume = {3}, number = {4}, pages = {202--213}, year = {2015}, url = {https://doi.org/10.2991/ijndc.2015.3.4.1}, doi = {10.2991/IJNDC.2015.3.4.1}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijndc/BossardK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/c3s2e/Bossard15, author = {Antoine Bossard}, editor = {Jake Yue Chen and Mohammed J. Zaki and Tamer Kahveci and Saeed Salem and Mehmet Koyut{\"{u}}rk}, title = {Premises of an algebra of Japanese characters}, booktitle = {Proceedings of the Eighth International C* Conference on Computer Science {\&} Software Engineering, Yokohama, Japan, July 13-15, 2015}, pages = {79--87}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2790798.2790800}, doi = {10.1145/2790798.2790800}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/c3s2e/Bossard15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/snpd/BossardK15, author = {Antoine Bossard and Keiichi Kaneko}, editor = {Roger Lee}, title = {On Solving the Container Problem in a Hypercube with Bit Constraint}, booktitle = {Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2015 [revised selected papers from {SNPD} 2015, Takamatsu, Japan, June 1-3, 2015]}, series = {Studies in Computational Intelligence}, volume = {612}, pages = {77--92}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-23509-7\_6}, doi = {10.1007/978-3-319-23509-7\_6}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/snpd/BossardK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cj/BossardK14, author = {Antoine Bossard and Keiichi Kaneko}, title = {Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks}, journal = {Comput. J.}, volume = {57}, number = {2}, pages = {332--337}, year = {2014}, url = {https://doi.org/10.1093/comjnl/bxs171}, doi = {10.1093/COMJNL/BXS171}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cj/BossardK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isca/Bossard14, author = {Antoine Bossard}, title = {A Set-to-set Disjoint Paths Routing Algorithm in Hyper-star Graphs}, journal = {Int. J. Comput. Their Appl.}, volume = {21}, number = {1}, pages = {76--82}, year = {2014}, timestamp = {Thu, 16 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isca/Bossard14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isca/Bossard14a, author = {Antoine Bossard}, title = {Japanese Characters Cartography for Efficient Memorization}, journal = {Int. J. Comput. Their Appl.}, volume = {21}, number = {3}, pages = {170--177}, year = {2014}, timestamp = {Thu, 16 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isca/Bossard14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/isca/BossardSOKSMM14, author = {Antoine Bossard and Yuki Sugano and Shinya Onogi and Toshikazu Kato and Nobuhiko Shigehara and Takashi Mochizuki and Kohji Masuda}, title = {Reconstruction and Auto-correction of Artificial Capillary with Flow Directions from Ultrasound Volume Data}, journal = {Int. J. Comput. Their Appl.}, volume = {21}, number = {4}, pages = {203--210}, year = {2014}, timestamp = {Thu, 16 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/isca/BossardSOKSMM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jise/BossardK14, author = {Antoine Bossard and Keiichi Kaneko}, title = {Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes}, journal = {J. Inf. Sci. Eng.}, volume = {30}, number = {4}, pages = {1087--1093}, year = {2014}, url = {http://www.iis.sinica.edu.tw/page/jise/2014/201407\_09.html}, timestamp = {Fri, 16 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jise/BossardK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tjs/BossardK14, author = {Antoine Bossard and Keiichi Kaneko}, title = {k-pairwise disjoint paths routing in perfect hierarchical hypercubes}, journal = {J. Supercomput.}, volume = {67}, number = {2}, pages = {485--495}, year = {2014}, url = {https://doi.org/10.1007/s11227-013-1013-9}, doi = {10.1007/S11227-013-1013-9}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tjs/BossardK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tjs/Bossard14, author = {Antoine Bossard}, title = {The decycling problem in hierarchical cubic networks}, journal = {J. Supercomput.}, volume = {69}, number = {1}, pages = {293--305}, year = {2014}, url = {https://doi.org/10.1007/s11227-014-1152-7}, doi = {10.1007/S11227-014-1152-7}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tjs/Bossard14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ic-nc/BossardK14, author = {Antoine Bossard and Keiichi Kaneko}, title = {On Hypercube Routing and Fault Tolerance with Bit Constraint}, booktitle = {Second International Symposium on Computing and Networking, {CANDAR} 2014, Shizuoka, Japan, December 10-12, 2014}, pages = {40--49}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/CANDAR.2014.46}, doi = {10.1109/CANDAR.2014.46}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ic-nc/BossardK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iccS/BossardK14, author = {Antoine Bossard and Keiichi Kaneko}, editor = {David Abramson and Michael Lees and Valeria V. Krzhizhanovskaya and Jack J. Dongarra and Peter M. A. Sloot}, title = {The Container Problem in a Torus-connected Cycles Network}, booktitle = {Proceedings of the International Conference on Computational Science, {ICCS} 2014, Cairns, Queensland, Australia, 10-12 June, 2014}, series = {Procedia Computer Science}, volume = {29}, pages = {2182--2191}, publisher = {Elsevier}, year = {2014}, url = {https://doi.org/10.1016/j.procs.2014.05.203}, doi = {10.1016/J.PROCS.2014.05.203}, timestamp = {Tue, 20 Jun 2023 16:27:45 +0200}, biburl = {https://dblp.org/rec/conf/iccS/BossardK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iiaiaai/Bossard14, author = {Antoine Bossard}, title = {Analysis of the Poisson Distribution Applicability to the Japanese Seismic Activity}, booktitle = {{IIAI} 3rd International Conference on Advanced Applied Informatics, {IIAI-AAI} 2014, Kokura Kita-ku, Japan, August 31 - Sept. 4, 2014}, pages = {430--435}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/IIAI-AAI.2014.93}, doi = {10.1109/IIAI-AAI.2014.93}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iiaiaai/Bossard14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/join/Bossard13, author = {Antoine Bossard}, title = {On the Decycling Problem in Hierarchical Hypercubes}, journal = {J. Interconnect. Networks}, volume = {14}, number = {2}, year = {2013}, url = {https://doi.org/10.1142/S0219265913500060}, doi = {10.1142/S0219265913500060}, timestamp = {Fri, 05 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/join/Bossard13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cbms/MasudaBSKO13, author = {Kohji Masuda and Antoine Bossard and Yuki Sugano and Toshikazu Kato and Shinya Onogi}, editor = {Pedro Pereira Rodrigues and Mykola Pechenizkiy and Jo{\~{a}}o Gama and Ricardo Cruz{-}Correia and Jiming Liu and Agma J. M. Traina and Peter J. F. Lucas and Paolo Soda}, title = {Reconstruction and error detection of blood vessel network from ultrasound volume data}, booktitle = {Proceedings of the 26th {IEEE} International Symposium on Computer-Based Medical Systems, Porto, Portugal, June 20-22, 2013}, pages = {497--501}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/CBMS.2013.6627850}, doi = {10.1109/CBMS.2013.6627850}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cbms/MasudaBSKO13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ica3pp/BossardK13, author = {Antoine Bossard and Keiichi Kaneko}, editor = {Rocco Aversa and Joanna Kolodziej and Jun Zhang and Flora Amato and Giancarlo Fortino}, title = {Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems}, booktitle = {Algorithms and Architectures for Parallel Processing - 13th International Conference, {ICA3PP} 2013, Vietri sul Mare, Italy, December 18-20, 2013, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8286}, pages = {11--21}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-03889-6\_2}, doi = {10.1007/978-3-319-03889-6\_2}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/ica3pp/BossardK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cj/BossardK12, author = {Antoine Bossard and Keiichi Kaneko}, title = {The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes}, journal = {Comput. J.}, volume = {55}, number = {6}, pages = {769--775}, year = {2012}, url = {https://doi.org/10.1093/comjnl/bxr135}, doi = {10.1093/COMJNL/BXR135}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cj/BossardK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cj/BossardK12a, author = {Antoine Bossard and Keiichi Kaneko}, title = {Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks}, journal = {Comput. J.}, volume = {55}, number = {12}, pages = {1440--1446}, year = {2012}, url = {https://doi.org/10.1093/comjnl/bxr137}, doi = {10.1093/COMJNL/BXR137}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cj/BossardK12a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/embc/BossardKM12, author = {Antoine Bossard and Toshikazu Kato and Kohji Masuda}, title = {Supporting reconstruction of the blood vessel network using graph theory: An abstraction method}, booktitle = {Annual International Conference of the {IEEE} Engineering in Medicine and Biology Society, {EMBC} 2012, San Diego, CA, USA, August 28 - September 1, 2012}, pages = {5470--5473}, publisher = {{IEEE}}, year = {2012}, url = {https://doi.org/10.1109/EMBC.2012.6347232}, doi = {10.1109/EMBC.2012.6347232}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/embc/BossardKM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cit/HosogaiMJKBXIK11, author = {Eri Hosogai and Tsubasa Mukai and Sinyu Jung and Yasufumi Kowase and Antoine Bossard and Yong Xu and Masatoshi Ishikawa and Keiichi Kaneko}, title = {A Multilingual Chat System with Image Presentation for Detecting Mistranslation}, journal = {J. Comput. Inf. Technol.}, volume = {19}, number = {4}, pages = {247--253}, year = {2011}, url = {https://doi.org/10.2498/cit.1002028}, doi = {10.2498/CIT.1002028}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cit/HosogaiMJKBXIK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cj/BossardKP11, author = {Antoine Bossard and Keiichi Kaneko and Shietung Peng}, title = {A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes}, journal = {Comput. J.}, volume = {54}, number = {8}, pages = {1372--1381}, year = {2011}, url = {https://doi.org/10.1093/comjnl/bxr047}, doi = {10.1093/COMJNL/BXR047}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cj/BossardKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/c3s2e/BossardK11, author = {Antoine Bossard and Keiichi Kaneko}, editor = {Bipin C. Desai and Alain Abran and Sudhir P. Mudur}, title = {Set-to-set disjoint-path routing in perfect hierarchical hypercubes}, booktitle = {Fourth International C* Conference on Computer Science {\&} Software Engineering, {C3S2E} 2011, Montreal, Quebec, Canada, May 16-18, 2011, Proceedings}, pages = {51--57}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1992896.1992903}, doi = {10.1145/1992896.1992903}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/c3s2e/BossardK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cata/IwasawaBK11, author = {Nagateru Iwasawa and Antoine Bossard and Keiichi Kaneko}, editor = {Wei Li}, title = {Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs}, booktitle = {Proceedings of the {ISCA} 26th International Conference on Computers and Their Applications, {CATA} 2011, March 23-15, 2011, Holiday Inn Downtown-Superdome, New Orleans, Louisiana, {USA}}, pages = {21--26}, publisher = {{ISCA}}, year = {2011}, timestamp = {Mon, 14 Nov 2011 12:39:54 +0100}, biburl = {https://dblp.org/rec/conf/cata/IwasawaBK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/procedia/BossardKP11, author = {Antoine Bossard and Keiichi Kaneko and Shietung Peng}, editor = {Mitsuhisa Sato and Satoshi Matsuoka and Peter M. A. Sloot and G. Dick van Albada and Jack J. Dongarra}, title = {Node-to-set disjoint-path routing in perfect hierarchical hypercubes}, booktitle = {Proceedings of the International Conference on Computational Science, {ICCS} 2011, Nanyang Technological University, Singapore, 1-3 June, 2011}, series = {Procedia Computer Science}, volume = {4}, pages = {442--451}, publisher = {Elsevier}, year = {2011}, url = {https://doi.org/10.1016/j.procs.2011.04.046}, doi = {10.1016/J.PROCS.2011.04.046}, timestamp = {Wed, 27 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/procedia/BossardKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ica3pp/BossardKP10, author = {Antoine Bossard and Keiichi Kaneko and Shietung Peng}, editor = {Ching{-}Hsien Hsu and Laurence Tianruo Yang and Jong Hyuk Park and Sang{-}Soo Yeo}, title = {Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes}, booktitle = {Algorithms and Architectures for Parallel Processing, 10th International Conference, {ICA3PP} 2010, Busan, Korea, May 21-23, 2010. Proceedings. Part {I}}, series = {Lecture Notes in Computer Science}, volume = {6081}, pages = {511--519}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13119-6\_44}, doi = {10.1007/978-3-642-13119-6\_44}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/ica3pp/BossardKP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ispan/BossardKP09, author = {Antoine Bossard and Keiichi Kaneko and Shietung Peng}, title = {A Node-to-Set Disjoint-Path Routing Algorithm in Metacube}, booktitle = {The 10th International Symposium on Pervasive Systems, Algorithms, and Networks, {ISPAN} 2009, Kaohsiung, Taiwan, December 14-16, 2009}, pages = {23--28}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/I-SPAN.2009.66}, doi = {10.1109/I-SPAN.2009.66}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ispan/BossardKP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pdcat/BossardKP09, author = {Antoine Bossard and Keiichi Kaneko and Shietung Peng}, title = {Node-to-Set Disjoint-path Routing in Metacube}, booktitle = {2009 International Conference on Parallel and Distributed Computing, Applications and Technologies, {PDCAT} 2009, Higashi Hiroshima, Japan, 8-11 December 2009}, pages = {57--62}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/PDCAT.2009.63}, doi = {10.1109/PDCAT.2009.63}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/pdcat/BossardKP09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.