| |
      |
                                          |
Note: Links lead to the DBLP on the Web. George Karypis Mukund Deshpande , Michihiro Kuramochi , George Karypis: Mining Chemical Compounds. Data Mining in Bioinformatics 2005 : 189-215 Ying Zhao , George Karypis: Soft clustering criterion functions for partitional document clustering: a summary of results. CIKM 2004 : 246-247 Navaratnasothie Selvakkumaran , Abhishek Ranjan , Salil Raje , George Karypis: Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources. DAC 2004 : 741-746 Navaratnasothie Selvakkumaran , Abhishek Ranjan , Salil Raje , George Karypis: Multi-resource aware partitioning algorithms for FPGAs with heterogeneous resources. FPGA 2004 : 253 Jianyong Wang , George Karypis: SUMMARY: Efficiently Summarizing Transactions for Clustering. ICDM 2004 : 241-248 Michihiro Kuramochi , George Karypis: GREW-A Scalable Frequent Subgraph Discovery Algorithm. ICDM 2004 : 439-442 Krishna Gade , Jianyong Wang , George Karypis: Efficient closed pattern mining in the presence of tough block constraints. KDD 2004 : 138-147 Jianyong Wang , George Karypis: BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint. SDM 2004 Michihiro Kuramochi , George Karypis: Finding Frequent Patterns in a Large Sparse Graph. SDM 2004 Mukund Deshpande , George Karypis: Item-based top- N recommendation algorithms. ACM Trans. Inf. Syst. 22 (1): 143-177 (2004) Mukund Deshpande , George Karypis: Selective Markov models for predicting Web page accesses. ACM Trans. Internet Techn. 4 (2): 163-184 (2004) Michihiro Kuramochi , George Karypis: An Efficient Algorithm for Discovering Frequent Subgraphs. IEEE Trans. Knowl. Data Eng. 16 (9): 1038-1051 (2004) Ying Zhao , George Karypis: Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering. Machine Learning 55 (3): 311-331 (2004) Valerie Guralnik , George Karypis: Parallel tree-projection-based sequence mining algorithms. Parallel Computing 30 (4): 443-472 (2004) Ying Zhao , George Karypis: Prediction of Contact Maps Using Support Vector Machines. BIBE 2003 : 26- Eui-Hong Han , George Karypis, Doug Mewhort , Keith Hatchard : Intelligent metasearch engine for knowledge management. CIKM 2003 : 492-495 Navaratnasothie Selvakkumaran , George Karypis: Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization. ICCAD 2003 : 726-733 Mukund Deshpande , Michihiro Kuramochi , George Karypis: Frequent Sub-Structure-Based Approaches for Classifying Chemical Compounds. ICDM 2003 : 35-42 George Karypis: Multi-Constraint Mesh Partitioning for Contact/Impact Computations. SC 2003 : 56 Navaratnasothie Selvakkumaran , Phiroze N. Parakh , George Karypis: Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement. SLIP 2003 : 53-59 Mukund Deshpande , Michihiro Kuramochi , George Karypis: Automated Approaches for Classifying Structures. BIOKDD 2002 : 11-18 Mukund Deshpande , George Karypis: Using conjunction of attribute values for classification. CIKM 2002 : 356-364 Ying Zhao , George Karypis: Evaluation of hierarchical clustering algorithms for document datasets. CIKM 2002 : 515-524 Cristinel Ababei , Navaratnasothie Selvakkumaran , Kia Bazargan , George Karypis: Multi-objective circuit partitioning for cutsize and path-based delay minimization. ICCAD 2002 : 181-185 Michihiro Kuramochi , George Karypis: Discovering Frequent Geometric Subgraphs. ICDM 2002 : 258-265 Masakazu Seno , George Karypis: SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint. ICDM 2002 : 418-425 Ying Zhao , George Karypis: Improve Precategorized Collection Retrieval by Using Supervised Term Weighting Schemes. ITCC 2002 : 16-21 Mukund Deshpande , George Karypis: Evaluation of Techniques for Classifying Biological Sequences. PAKDD 2002 : 417-431 B. Uygar Oztekin , George Karypis, Vipin Kumar : Expert agreement and content based reranking in a meta search environment using Mearf. WWW 2002 : 333-344 Kirk Schloegel , George Karypis, Vipin Kumar : Parallel static and dynamic multi-constraint graph partitioning. Concurrency and Computation: Practice and Experience 14 (3): 219-240 (2002) Michihiro Kuramochi , George Karypis: Gene Classification using Expression Profiles: A Feasibility Study. BIBE 2001 : 191-200 Valerie Guralnik , George Karypis: A scalable algorithm for clustering protein sequences. BIOKDD 2001 : 73-80 George Karypis: Evaluation of Item-Based Top-N Recommendation Algorithms. CIKM 2001 : 247-254 Kirk Schloegel , George Karypis, Vipin Kumar : Graph Partitioning for Dynamic, Adaptive and Multi-phase Scientific Simulations. CLUSTER 2001 : 271-273 Valerie Guralnik , Nivea Garg , George Karypis: Parallel Tree Projection Algorithm for Sequence Mining. Euro-Par 2001 : 310-320 Valerie Guralnik , George Karypis: A Scalable Algorithm for Clustering Sequential Data. ICDM 2001 : 179-186 Michihiro Kuramochi , George Karypis: Frequent Subgraph Discovery. ICDM 2001 : 313-320 Masakazu Seno , George Karypis: LPMiner: An Algorithm for Finding Frequent Itemsets Using Length-Decreasing Support Constraint. ICDM 2001 : 505-512 Eui-Hong Han , George Karypis, Vipin Kumar : Text Categorization Using Weight Adjusted k-Nearest Neighbor Classification. PAKDD 2001 : 53-65 Irene Moulitsas , George Karypis: Multilevel algorithms for generating coarse grids for multigrid methods. SC 2001 : 45 Badrul M. Sarwar , George Karypis, Joseph A. Konstan , John Riedl : Item-based collaborative filtering recommendation algorithms. WWW 2001 : 285-295 Naren Ramakrishnan , Benjamin J. Keller , Batul J. Mirza , Ananth Grama , George Karypis: When being Weak is Brave: Privacy in Recommender Systems CoRR cs.CG/0105028 : (2001) Naren Ramakrishnan , Benjamin J. Keller , Batul J. Mirza , Ananth Grama , George Karypis: Privacy Risks in Recommender Systems. IEEE Internet Computing 5 (6): 54-62 (2001) Kirk Schloegel , George Karypis, Vipin Kumar : Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes. IEEE Trans. Parallel Distrib. Syst. 12 (5): 451-466 (2001) Badrul M. Sarwar , George Karypis, Joseph A. Konstan , John Riedl : Analysis of recommendation algorithms for e-commerce. ACM Conference on Electronic Commerce 2000 : 158-167 Eui-Hong Han , George Karypis: Fast Supervised Dimensionality Reduction Algorithm with Applications to Document Categorization & Retrieval. CIKM 2000 : 12-19 William Leinberger , George Karypis, Vipin Kumar : Memory Management Techniques for Gang Scheduling. Euro-Par 2000 : 252-261 Kirk Schloegel , George Karypis, Vipin Kumar : Parallel Multilevel Algorithms for Multi-constraint Graph Partitioning (Distinguished Paper). Euro-Par 2000 : 296-310 William Leinberger , George Karypis, Vipin Kumar : Load Balancing Across Near-Homogeneous Multi-Resource Servers. Heterogeneous Computing Workshop 2000 : 60-71 Vipin Kumar , Kirk Schloegel , George Karypis: Graph Partitioning for Dynamic, Adaptive, and Multi-phase Computations. IPDPS Workshops 2000 : 476-476 Eui-Hong Han , George Karypis: Centroid-Based Document Classification: Analysis and Experimental Results. PKDD 2000 : 424-431 Kirk Schloegel , George Karypis, Vipin Kumar : A Unified Algorithm for Load-balancing Adaptive Scientific Simulations. SC 2000 Eui-Hong Han , George Karypis, Vipin Kumar : Scalable Parallel Data Mining for Association Rules. IEEE Trans. Knowl. Data Eng. 12 (2): 377-352 (2000) Rupak Biswas , Bruce Hendrickson , George Karypis: Graph partitioning and parallel computing. Parallel Computing 26 (12): 1515-1517 (2000) George Karypis, Vipin Kumar : Multilevel k -way Hypergraph Partitioning. DAC 1999 : 343-348 Kirk Schloegel , George Karypis, Vipin Kumar : A New Algorithm for Multi-objective Graph Partitioning. Euro-Par 1999 : 322-331 William Leinberger , George Karypis, Vipin Kumar : Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints. ICPP 1999 : 404-412 Mahesh V. Joshi , Eui-Hong Han , George Karypis, Vipin Kumar : Efficient Parallel Algorithms for Mining Associations. Large-Scale Parallel Data Mining 1999 : 83-126 Kirk Schloegel , George Karypis, Vipin Kumar : Dynamic Repartitioning of Adaptively Refined Meshes. PPSC 1999 Mahesh V. Joshi , George Karypis, Vipin Kumar , Anshul Gupta , Fred G. Gustavson : PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver. PPSC 1999 Daniel Boley , Maria L. Gini , Robert Gross , Eui-Hong Han , Kyle Hastings , George Karypis, Vipin Kumar , Bamshad Mobasher , Jerome Moore : Document Categorization and Query Generation on the World Wide Web Using WebACE. Artif. Intell. Rev. 13 (5-6): 365-391 (1999) George Karypis, Eui-Hong Han , Vipin Kumar : Chameleon: Hierarchical Clustering Using Dynamic Modeling. IEEE Computer 32 (8): 68-75 (1999) Eui-Hong Han , Daniel Boley , Maria L. Gini , Robert Gross , Kyle Hastings , George Karypis, Vipin Kumar , Bamshad Mobasher , Jerome Moore : WebACE: A Web Agent for Document Categorization and Exploration. Agents 1998 : 408-415 Mahesh V. Joshi , George Karypis, Vipin Kumar : ScalParC: A New Scalable and Efficient Parallel Classification Algorithm for Mining Large Datasets. IPPS/SPDP 1998 : 573-579 Kirk Schloegel , George Karypis, Vipin Kumar : Load Balancing of Dynamic and Adaptive Mesh-Based Computations. Symposium on Reliable Distributed Systems 1998 : 311 Eui-Hong Han , George Karypis, Vipin Kumar , Bamshad Mobasher : Hypergraph Based Clustering in High-Dimensional Data Sets: A Summary of Results. IEEE Data Eng. Bull. 21 (1): 15-22 (1998) George Karypis, Vipin Kumar : A Parallel Algorithm for Multilevel Graph Partitioning and Sparse Matrix Ordering. J. Parallel Distrib. Comput. 48 (1): 71-95 (1998) George Karypis, Vipin Kumar : Multilevel k-way Partitioning Scheme for Irregular Graphs. J. Parallel Distrib. Comput. 48 (1): 96-129 (1998) George Karypis, Rajat Aggarwal , Vipin Kumar , Shashi Shekhar : Multilevel Hypergraph Partitioning: Application in VLSI Domain. DAC 1997 : 526-529 Eui-Hong Han , George Karypis, Vipin Kumar , Bamshad Mobasher : Clustering Based On Association Rule Hypergraphs. DMKD 1997 : 0- Kirk Schloegel , George Karypis, Vipin Kumar : Repartitioning of Adaptive Meshes: Experiments with Multilevel Diffusion. Euro-Par 1997 : 945-949 George Karypis, Vipin Kumar : A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm. PPSC 1997 Anshul Gupta , Fred G. Gustavson , Mahesh V. Joshi , George Karypis, Vipin Kumar : Design and Implementation of a Scalable Parallel Direct Solver for Sparse Symmetric Positive Definite Systems: Preliminary Results. PPSC 1997 Vipin Kumar , George Karypis, Ananth Grama : Role of Message-Passing in Performance Oriented Parallel Programming. PPSC 1997 Eui-Hong Han , George Karypis, Vipin Kumar : Scalable Parallel Data Mining for Association Rules. SIGMOD Conference 1997 : 277-288 Anshul Gupta , George Karypis, Vipin Kumar : Highly Scalable Parallel Algorithms for Sparse Matrix Factorization. IEEE Trans. Parallel Distrib. Syst. 8 (5): 502-520 (1997) Kirk Schloegel , George Karypis, Vipin Kumar : Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes. J. Parallel Distrib. Comput. 47 (2): 109-124 (1997) George Karypis, Vipin Kumar : Parallel Multilevel Graph Partitioning. IPPS 1996 : 314-319 George Karypis, Vipin Kumar : Multilevel Graph Partitioning Schemes. ICPP (3) 1995 : 113-122 George Karypis, Anshul Gupta , Vipin Kumar : A Highly Parallel Interior Point Algorithm. PPSC 1995 : 110-112 George Karypis, Vipin Kumar : Analysis of Multilevel Graph Partitioning. SC 1995 Vipin Kumar , Ananth Grama , Anshul Gupta , George Karypis: Introduction to Parallel Computing. Benjamin/Cummings 1994 George Karypis, Anshul Gupta , Vipin Kumar : A parallel formulation of interior point algorithms. SC 1994 : 204-213 George Karypis, Vipin Kumar : Unstructured Tree Search on SIMD Parallel Computers. IEEE Trans. Parallel Distrib. Syst. 5 (10): 1057-1072 (1994) George Karypis, Vipin Kumar : Efficient Parallel Mappings of a Dynamic Programming Algorithm: A Summary of Results. IPPS 1993 : 563-568 George Karypis, Vipin Kumar : Unstructured Tree Search on SIMD Parallel Computers: A Summary of Results. SC 1992 : 453-462 1 [ 63 ] 2 [ 18 ] 3 [ 63 ] 4 [ 33 ] 5 [ 24 ] [ 26 ] 6 [ 59 ] [ 65 ] [ 66 ] [ 69 ] [ 76 ] [ 77 ] [ 86 ] 7 [ 80 ] 8 [ 52 ] 9 [ 24 ] [ 26 ] 10 [ 5 ] [ 13 ] [ 44 ] [ 45 ] 11 [ 24 ] [ 26 ] 12 [ 4 ] [ 5 ] [ 7 ] [ 11 ] [ 14 ] [ 27 ] 13 [ 51 ] [ 52 ] [ 55 ] [ 73 ] 14 [ 14 ] [ 27 ] 15 [ 12 ] [ 17 ] [ 21 ] [ 24 ] [ 25 ] [ 26 ] [ 29 ] [ 34 ] [ 36 ] [ 41 ] [ 48 ] [ 71 ] 16 [ 24 ] [ 26 ] 17 [ 71 ] 18 [ 33 ] 19 [ 14 ] [ 23 ] [ 27 ] [ 29 ] 20 [ 44 ] [ 45 ] 21 [ 42 ] [ 46 ] 22 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 34 ] [ 35 ] [ 37 ] [ 38 ] [ 39 ] [ 40 ] [ 43 ] [ 48 ] [ 53 ] [ 57 ] [ 58 ] 23 [ 50 ] [ 56 ] [ 62 ] [ 66 ] [ 69 ] [ 75 ] [ 78 ] [ 81 ] [ 86 ] 24 [ 30 ] [ 38 ] [ 40 ] 25 [ 71 ] 26 [ 44 ] [ 45 ] 27 [ 17 ] [ 21 ] [ 24 ] [ 26 ] 28 [ 24 ] [ 26 ] 29 [ 47 ] 30 [ 58 ] 31 [ 67 ] 32 [ 83 ] [ 84 ] 33 [ 44 ] [ 45 ] 34 [ 83 ] [ 84 ] 35 [ 42 ] [ 46 ] 36 [ 42 ] [ 46 ] 37 [ 10 ] [ 16 ] [ 22 ] [ 28 ] [ 31 ] [ 35 ] [ 37 ] [ 39 ] [ 43 ] [ 53 ] [ 57 ] 38 [ 63 ] [ 67 ] [ 70 ] [ 83 ] [ 84 ] 39 [ 49 ] [ 61 ] 40 [ 18 ] 41 [ 79 ] [ 80 ] [ 82 ] 42 [ 60 ] [ 64 ] [ 72 ] [ 74 ] [ 85 ]  ©2005 Association for Computing Machinery |
