| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Carson Kai-Sang Leung Carson Kai-Sang Leung, Wookey Lee : Exploitation of Referential Integrity Constraints for Efficient Update of Data Warehouse Views. BNCOD 2005 : 98-110 Carson Kai-Sang Leung, Quamrul I. Khan , Tariqul Hoque : CanTree: A Tree Structure for Efficient Incremental Mining of Frequent Patterns. ICDM 2005 : 274-281 Carson Kai-Sang Leung: Dynamic FP-Tree Based Mining of Frequent Patterns Satisfying Succinct Constraints. CDB 2004 : 117-132 Carson Kai-Sang Leung: Efficient Parallel Mining of Constrained Frequent Patterns. HPCS 2004 : 73-82 Carson Kai-Sang Leung: Interactive Constrained Frequent-Pattern Mining System. IDEAS 2004 : 49-58 Laks V. S. Lakshmanan , Carson Kai-Sang Leung, Raymond T. Ng : Efficient dynamic mining of constrained frequent sets. ACM Trans. Database Syst. 28 (4): 337-389 (2003) Carson Kai-Sang Leung, Raymond T. Ng , Heikki Mannila : OSSM: A Segmentation Approach to Optimize Frequency Counting. ICDE 2002 : 583-592 Carson Kai-Sang Leung, Laks V. S. Lakshmanan , Raymond T. Ng : Exploiting succinct constraints using FP-trees. SIGKDD Explorations 4 (1): 40-49 (2002) Laks V. S. Lakshmanan , Carson Kai-Sang Leung, Raymond T. Ng : The Segment Support Map: Scalable Mining of Frequent Itemsets. SIGKDD Explorations 2 (2): 21-27 (2000) Carson Kai-Sang Leung, Raymond T. Ng : Multiresolution Subimage Similarity Matching for Large Image Databases. Storage and Retrieval for Image and Video Databases (SPIE) 1998 : 259-270 Carson Kai-Sang Leung, Raymond T. Ng : Multiscale Similarity Matching for Subimage Queries of Arbitrary Size. VDB 1998 : 243-264 1 [ 10 ] 2 [ 10 ] 3 [ 3 ] [ 4 ] [ 6 ] 4 [ 11 ] 5 [ 5 ] 6 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]  ©2006 Association for Computing Machinery |
