Author of the publication

A new algorithm for discovering the maximum frequent set.

, and . Proceedings of the 6th Int'l Conf.on Extending Database Technology (EDBT), page 105--119. (March 1998)

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.

 

Other publications of authors with the same name

A new algorithm for discovering the maximum frequent set., and . Proceedings of the 6th Int'l Conf.on Extending Database Technology (EDBT), page 105--119. (March 1998)Synthesizing Linear Array Algorithms from Nested For Loop Algorithms., and . IEEE Trans. Computers, 37 (12): 1578-1598 (1988)Transparent Distribution Middleware for General Purpose Computations., , and . PDPTA, page 417-423. CSREA Press, (1999)Fast Parallel Algorithms for Coloring Random Graphs., , , , and . WG, volume 570 of Lecture Notes in Computer Science, page 135-147. Springer, (1991)Optimal Allocation of Computational Resources in VLSI. FOCS, page 379-385. IEEE Computer Society, (1982)Metacomputing with MILAN., , , and . Heterogeneous Computing Workshop, page 169-183. IEEE Computer Society, (1999)CALYPSO: A Novel Software System for Fault-Tolerant Parallel Processing on Distributed Platforms., , and . HPDC, page 122-129. IEEE Computer Society, (1995)Reducing the effect of mobility on TCP by making route caches quickly adapt to topology changes., and . ICC, page 4103-4110. IEEE, (2004)Optimal Allocation of Area for Single-Chip Computations.. SIAM J. Comput., 14 (3): 730-743 (1985)Parallel Suffix-Prefix-Matching Algorithm and Applications., , and . SIAM J. Comput., 25 (5): 998-1023 (1996)