Antoine Bossard

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 25

Top Topics

Poisson Distribution

Routing Algorithm

Top Venues

Int. J. Comput. Their Appl.

J. Supercomput.

Publications

Antoine Bossard
Torus-Connected Toroids: An Efficient Topology for Interconnection Networks. Comput. 12 (9) (2023)
Antoine Bossard, Keiichi Kaneko, Frederick C. Harris Jr.
On the Crossing Number of a Torus Network. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106 (1) (2023)
Antoine Bossard
On Modern User Interface Development and the Case of Android Applications. J. Softw. 18 (4) (2023)
Antoine Bossard
On the Automatisation of the Realisation of a Banduke Table. DB&IS (2022)
Antoine Bossard
The SOF Programming Paradigm: A Sequence of Pure Functions. Int. J. Softw. Innov. 10 (1) (2022)
Antoine Bossard
Topological properties of a 2-dimensional torus-connected cycles network. ICCCM (2022)
Antoine Bossard
On the Automatised Generation of a Japanese Banduke Table. Balt. J. Mod. Comput. 10 (4) (2022)
Keiichi Kaneko, Antoine Bossard, Frederick C. Harris
Set-to-Set Disjoint Path Routing in Bijective Connection Graphs. IEEE Access 10 (2022)
Antoine Bossard
On Solving the Decycling Problem in a Torus Network. Wirel. Commun. Mob. Comput. 2021 (2021)
Antoine Bossard
On the Erdős-Sós Conjecture for Stars, Paths and Some of Their Variants. ICIS (2021)
Antoine Bossard
On Bridging the Gap Between Far Eastern Cultures and the User Interface. WorldCIST (1) (2021)
Antoine Bossard, Keiichi Kaneko
Cluster-Fault Tolerant Routing in a Torus. Sensors 20 (11) (2020)
Antoine Bossard
On the Decycling Problem in a Torus. PAAP (2020)
Antoine Bossard, Keiichi Kaneko
A New Methodology for a Functional and Logic Programming Course: On Smoothening the Transition between the Two Paradigms. SIGITE (2019)
Antoine Bossard, Keiichi Kaneko
Refining the Unrestricted Character Encoding for Japanese. CATA (2019)
Antoine Bossard, Keiichi Kaneko
UCEJ Database Refinement and Applicability Proof. ISM (2019)
Antoine Bossard, Keiichi Kaneko
Unrestricted Character Encoding for Japanese. DB&IS (Selected Papers) (2018)
Antoine Bossard, Keiichi Kaneko
On the Torus Pairwise Disjoint-Path Routing Problem. iThings/GreenCom/CPSCom/SmartData (2018)
Antoine Bossard, Keiichi Kaneko
Proposal of an Unrestricted Character Encoding for Japanese. DB&IS (2018)
Antoine Bossard, Keiichi Kaneko
Torus Pairwise Disjoint-Path Routing. Sensors 18 (11) (2018)
Keiichi Kaneko, Antoine Bossard
A Set-to-Set Disjoint Paths Routing Algorithm in Tori. Int. J. Netw. Comput. 7 (2) (2017)
Antoine Bossard
Automatic Segmentation of Chinese Characters as Wire-Frame Models. ICCS (2017)
Antoine Bossard
High-Performance Graphics in Racket with DirectX. ICA3PP (2017)
Keiichi Kaneko, Antoine Bossard
Set-to-Set Disjoint Paths in Tori. CANDAR (2016)
Antoine Bossard, Keiichi Kaneko
Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles. IEICE Trans. Inf. Syst. (11) (2016)
Antoine Bossard
Premises of an algebra of Japanese characters. C3S2E (2015)
Antoine Bossard, Keiichi Kaneko
A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint. Int. J. Networked Distributed Comput. 3 (4) (2015)
Antoine Bossard, Keiichi Kaneko
On Solving the Container Problem in a Hypercube with Bit Constraint. SNPD (revised selected papers) (2015)
Antoine Bossard, Keiichi Kaneko
Hypercube Fault Tolerant Routing with Bit Constraint. Int. J. Netw. Comput. 5 (2) (2015)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
Node-to-set disjoint paths routing in a metacube. Int. J. High Perform. Comput. Netw. 8 (4) (2015)
Antoine Bossard, Keiichi Kaneko
Torus-Connected Cycles: A Simple And Scalable Topology For Interconnection Networks. Int. J. Appl. Math. Comput. Sci. 25 (4) (2015)
Antoine Bossard, Yuki Sugano, Shinya Onogi, Toshikazu Kato, Nobuhiko Shigehara, Takashi Mochizuki, Kohji Masuda
Reconstruction and Auto-correction of Artificial Capillary with Flow Directions from Ultrasound Volume Data. Int. J. Comput. Their Appl. 21 (4) (2014)
Antoine Bossard, Keiichi Kaneko
On Hypercube Routing and Fault Tolerance with Bit Constraint. CANDAR (2014)
Antoine Bossard, Keiichi Kaneko
The Container Problem in a Torus-connected Cycles Network. ICCS (2014)
Antoine Bossard, Keiichi Kaneko
Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks. Comput. J. 57 (2) (2014)
Antoine Bossard
Japanese Characters Cartography for Efficient Memorization. Int. J. Comput. Their Appl. 21 (3) (2014)
Antoine Bossard
Analysis of the Poisson Distribution Applicability to the Japanese Seismic Activity. IIAI-AAI (2014)
Antoine Bossard, Keiichi Kaneko
k-pairwise disjoint paths routing in perfect hierarchical hypercubes. J. Supercomput. 67 (2) (2014)
Antoine Bossard
A Set-to-set Disjoint Paths Routing Algorithm in Hyper-star Graphs. Int. J. Comput. Their Appl. 21 (1) (2014)
Antoine Bossard, Keiichi Kaneko
Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. J. Inf. Sci. Eng. 30 (4) (2014)
Antoine Bossard
The decycling problem in hierarchical cubic networks. J. Supercomput. 69 (1) (2014)
Antoine Bossard
On the Decycling Problem in Hierarchical Hypercubes. J. Interconnect. Networks 14 (2) (2013)
Antoine Bossard, Keiichi Kaneko
Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems. ICA3PP (2) (2013)
Kohji Masuda, Antoine Bossard, Yuki Sugano, Toshikazu Kato, Shinya Onogi
Reconstruction and error detection of blood vessel network from ultrasound volume data. CBMS (2013)
Antoine Bossard, Toshikazu Kato, Kohji Masuda
Supporting reconstruction of the blood vessel network using graph theory: An abstraction method. EMBC (2012)
Antoine Bossard, Keiichi Kaneko
The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes. Comput. J. 55 (6) (2012)
Antoine Bossard, Keiichi Kaneko
Node-to-Set Disjoint-Path Routing in Hierarchical Cubic Networks. Comput. J. 55 (12) (2012)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes. Comput. J. 54 (8) (2011)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
Node-to-set disjoint-path routing in perfect hierarchical hypercubes. ICCS (2011)
Nagateru Iwasawa, Antoine Bossard, Keiichi Kaneko
Set-to-Set Disjoint Path Routing Algorithm in Burnt Pancake Graphs. CATA (2011)
Antoine Bossard, Keiichi Kaneko
Set-to-set disjoint-path routing in perfect hierarchical hypercubes. C3S2E (2011)
Eri Hosogai, Tsubasa Mukai, Sinyu Jung, Yasufumi Kowase, Antoine Bossard, Yong Xu, Masatoshi Ishikawa, Keiichi Kaneko
A Multilingual Chat System with Image Presentation for Detecting Mistranslation. J. Comput. Inf. Technol. 19 (4) (2011)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. ICA3PP (1) (2010)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
Node-to-Set Disjoint-path Routing in Metacube. PDCAT (2009)
Antoine Bossard, Keiichi Kaneko, Shietung Peng
A Node-to-Set Disjoint-Path Routing Algorithm in Metacube. ISPAN (2009)