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)
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)
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)
The majority of systemic sclerosis (SSc) patients have gastrointestinal tract involvement, but therapies of prokinetic agents are usually unsatisfactory. Patients are often compromised by the use of steroid; therefore, a surgical indication including fundoplication has been controversial. There is no report that advanced SSc with severe gastroesophageal(More)