Ryo Kato

Learn More
For a set S of n points in the plane, a Manhattan network on S is a geometric network G(S) such that, for each pair of points in S, G(S) contains a rectilinear path between them of length equal to their distance in the L1-metric. The minimum Manhattan network problem is a problem of finding a Manhattan network of minimum length. Gud-mundsson, Levcopoulos,(More)
Recent studies suggest that action video game players exhibit superior performance in visuospatial cognitive tasks compared with non-game players. However, the neural basis underlying this visuospatial cognitive performance advantage remains largely unknown. The present human behavioral and imaging study compared gray matter volume in action video game(More)
A variety of services utilizing users' positions have become available because of rapid advances in Global Positioning System (GPS) technologies. Since location information may reveal private information, preserving location privacy has become a significant issue. We proposed a dummy-based method of anonymizing location to protect this privacy in our(More)
This paper quantifies the procyclical effects of bank capital requirements in a general equilibrium model where financing of capital goods production is subject to an agency problem. At the center of this problem is the interaction between entrepreneurs' moral hazard and liquidity provision by banks as analyzed by Holmstrom and Tirole (1998). We impose(More)
Papers in the Bank of Japan Working Paper Series are circulated in order to stimulate discussion and comments. Views expressed are those of authors and do not necessarily reflect those of the Bank. If you have any comment or question on the working paper series, please contact each author. When making a copy or reproduction of the content for commercial(More)
The views expressed in this paper are solely those of the authors and should not be interpreted as reflecting those of the Bank of Japan or the International Department. We thank our colleagues at the Bank of Japan for helpful comments. We are particularly indebted to Koichiro Kamada (Research and Statistics Department) for his valuable comments on the(More)
The " cvpaper.challenge " is a group composed of members from AIST, Tokyo Denki Univ. (TDU), and Univ. of Tsukuba that aims to systematically summarize papers on computer vision, pattern recognition, and related fields. For this particular review, we focused on reading the ALL 602 conference papers presented at the CVPR2015, the premier annual computer(More)