( en | de | ru )

 

Disambiguation of "Tokuyama, Takeshi"

Author of the publication

copydeleteadd this publication to your clipboard
Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets.

, , and . SCG, page 314-323. ACM, (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Takeshi Morita

Takeshi Morita

Takeshi Imamura

Takeshi Omori

Takeshi Yasui

 

Other publications of authors with the same name

Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k., , , and . STOC, page 275-283. ACM, (1997)Optimal On-line Algorithms for an Electronic Commerce Money Distribution System., , and . SODA, page 527-536. ACM/SIAM, (1999)Efficient Algorithms for the Hitchcock Transportation Problem., and . SODA, page 175-184. ACM/SIAM, (1992)Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning., , , and . SODA, page 896-904. ACM/SIAM, (2002)Computing Optimized Rectilinear Regions for Association Rules., , , , and . KDD, page 96-103. AAAI Press, (1997)Cascade of Multi-level Multi-instance Classifiers for Image Annotation., , and . KDIR, page 14-23. SciTePress, (2011)On the Complexities of the Optimal Rounding Problems of Sequences and Matrices., , and . SWAT, volume 1851 of Lecture Notes in Computer Science, page 476-489. Springer, (2000)Base Location Problems for Base-Monotone Regions., , , , , , , , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 53-64. Springer, (2013)Walking on an Arrangement Topologically., , and . SCG, page 297-306. ACM, (1991)How to Cut Pseudo-Parabolas into Segments., and . SCG, page 230-237. ACM, (1995)