Shin-ichi Minato

1. Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes
   2020/04/08 by Yuya Sugie, Sugie, Yuya, Yuki Yoshida +17 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Emerging Technologies (cs.ET) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Stochastic Gradient Optimization Techniques
2. Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization
   2020/01/24 by Yu Nakahata, Takashi Horiyama, Nakahata, Yu +5 · 1 citation
   Computer Science · #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Data Management and Algorithms #FOS: Computer and information sciences #Topological and Geometric Data Analysis