Takeshi Tokuyama
Takeshi Tokuyama
Dirección de correo verificada de dais.is.tohoku.ac.jp
TítuloCitado porAño
Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization
T Fukuda, Y Morimoto, S Morishita, T Tokuyama
Acm Sigmod Record 25 (2), 13-23, 1996
4201996
Mining optimized association rules for numeric attributes
T Fukuda, Y Morimoto, S Morishita, T Tokuyama
Journal of Computer and System Sciences 58 (1), 1-12, 1999
4041999
Greedily finding a dense subgraph
Y Asahiro, K Iwama, H Tamaki, T Tokuyama
Journal of Algorithms 34 (2), 203-221, 2000
1822000
Data mining with optimized two-dimensional association rules
T Fukuda, Y Morimoto, S Morishita, T Tokuyama
ACM Transactions on Database Systems (TODS) 26 (2), 179-213, 2001
1262001
Finding a minimum-weightk-link path in graphs with the concave Monge property and applications
A Aggarwal, B Schieber, T Tokuyama
Discrete & Computational Geometry 12 (3), 263-280, 1994
1251994
A generating function of strict Gelfand patterns and some formulas on characters of general linear groups
T Tokuyama
Journal of the Mathematical Society of Japan 40 (4), 671-685, 1988
871988
Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
T Akutsu, H Tamaki, T Tokuyama
Discrete & Computational Geometry 20 (3), 307-331, 1998
861998
Polynomial-time solutions to image segmentation
T Asano, DZ Chen, N Katoh, T Tokuyama
SODA 96, 104-113, 1996
861996
Computing Optimized Rectilinear Regions for Association Rules.
K Yoda, T Fukuda, Y Morimoto, S Morishita, T Tokuyama
KDD 97, 96-103, 1997
841997
Order-preserving matching
J Kim, P Eades, R Fleischer, SH Hong, CS Iliopoulos, K Park, SJ Puglisi, ...
Theoretical Computer Science 525, 68-79, 2014
832014
Constructing E cient Decision Trees by Using Optimized Numeric Association Rules
T Fukuda, Y Morimoto, S Morishita, T Tokuyama
Proceedings of the 22nd International Conference on Very Large Data Bases, 1996
781996
Algorithms for mining association rules for binary segmentations of huge categorical databases
Y Morimoto, T Fukuda, H Matsuzawa, T Tokuyama, K Yoda
VLDB 98, 380-391, 1998
741998
How to cut pseudoparabolas into segments
H Tamaki, T Tokuyama
Discrete & Computational Geometry 19 (2), 265-290, 1998
741998
Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication.
H Tamaki, T Tokuyama
SODA 1998, 446-452, 1998
691998
Walking in an arrangement topologically
T Asano, LJ Guibas, T Tokuyama
International Journal of Computational Geometry & Applications 4 (02), 123-151, 1994
631994
Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning
T Asano, N Katoh, K Obokata, T Tokuyama
SIAM Journal on Computing 32 (6), 1423-1435, 2003
562003
Method and apparatus for deriving an association rule between data
Y Morimoto, T Fukuda, S Morishita, T Tokuyama
US Patent 5,812,997, 1998
531998
Efficient algorithms for optimization-based image segmentation
T Asano, DZ Chen, N Katoh, T Tokuyama
International Journal of Computational Geometry & Applications 11 (02), 145-166, 2001
522001
Greedily finding a dense subgraph
Y Asahiro, K Iwama, H Tamaki, T Tokuyama
Scandinavian Workshop on Algorithm Theory, 136-148, 1996
511996
On minimum and maximum spanning trees of linearly moving points
N Katoh, T Tokuyama, K Iwano
Discrete & Computational Geometry 13 (2), 161-176, 1995
441995
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20