| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Ananth Grama Mehmet Koyutürk , Ananth Grama, Wojciech Szpankowski : Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments. CSB 2003 : 575-580 Ioannis Ioannidis , Ananth Grama: An Efficient Protocol for Yao?s Millionaires? Problem. HICSS 2003 : 205 Mohamed F. Mokbel , Walid G. Aref , Ananth Grama: Spectral LPM: An Optimal Locality-Preserving Mapping using the Spectral (not Fractal) Order. ICDE 2003 : 699-701 Ioannis Ioannidis , Ananth Grama, Mikhail J. Atallah : Adaptive Data Structures for IP Lookups. INFOCOM 2003 Mehmet Koyutürk , Ananth Grama: PROXIMUS: a framework for analyzing very high dimensional discrete-attributed datasets. KDD 2003 : 147-156 Sreekanth R. Sambavaram , Vivek Sarin , Ahmed H. Sameh , Ananth Grama: Multipole-based preconditioners for large sparse linear systems. Parallel Computing 29 (9): 1261-1273 (2003) Sacha Zyto , Ananth Grama, Wojciech Szpankowski : Semi-discrete Matrix Transforms (SDD) for Image and Video Compression. DCC 2002 : 484 Jie Chi , Alok R. Chaturvedi , Ananth Grama, Shailendra Raj Mehta : Oceanus: A Distributed Web-Based Framework for Execution of Genetic Algorithms. GECCO Late Breaking Papers 2002 : 55-61 Ioannis Ioannidis , Ananth Grama, Mikhail J. Atallah : A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments. ICPP 2002 : 379-384 Tzvetan Horozov , Ananth Grama, Venu Vasudevan , Sean Landis : MOBY - A Mobile Peer-to-Peer Service and Data Network. ICPP 2002 : 437-444 Mehmet Koyutürk , Ananth Grama, Naren Ramakrishnan : Algebraic Techniques for Analysis of Large Discrete-Valued Datasets. PKDD 2002 : 311-324 Ananth Grama, David Meyer , Wojciech Szpankowski : Real-Time Decompression of Streaming Video Using Mobile Code. Data Compression Conference 2001 : 496 Ananth Grama, Vipin Kumar , Sanjay Ranka , Vineet Singh : Architecture Independent Analysis of Parallel Programs. International Conference on Computational Science (2) 2001 : 599-608 Dow-Yung Yang , Ananth Grama, Vivek Sarin , Naren Ramakrishnan : Compression of particle data from hierarchical approximate methods. ACM Trans. Math. Softw. 27 (3): 317-339 (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) Dow-Yung Yang , Akshay Johar , Ananth Grama, Wojciech Szpankowski : Summary Structures for Frequency Queries on Large Transaction Sets. Data Compression Conference 2000 : 420-429 Marc Alzina , Wojciech Szpankowski , Ananth Grama: 2D-Pattern Matching Image and Video Compression. Data Compression Conference 1999 : 424-433 Naren Ramakrishnan , Ananth Grama: Data Mining: From Serendipity to Science - Guest Editors' Introduction. IEEE Computer 32 (8): 34-37 (1999) Ananth Grama, Vipin Kumar : State of the Art in Parallel Search Techniques for Discrete Optimization Problems. IEEE Trans. Knowl. Data Eng. 11 (1): 28-35 (1999) Ananth Grama, Vipin Kumar , Ahmed H. Sameh : Scalable Parallel Formulations of the Barnes-Hut Method for n -Body Simulations. Parallel Computing 24 (5-6): 797-822 (1998) Vipin Kumar , George Karypis , Ananth Grama: Role of Message-Passing in Performance Oriented Parallel Programming. PPSC 1997 Ananth Grama, Vipin Kumar , Ahmed H. Sameh : N-Body Simulations Using Message Passsing Parallel Computers. PPSC 1995 : 355-360 Ananth Grama, Vipin Kumar , Ahmed H. Sameh : Parallel Matrix-Vector Product Using Approximate Hierarchical Methods. SC 1995 Vipin Kumar , Ananth Grama, Anshul Gupta , George Karypis : Introduction to Parallel Computing. Benjamin/Cummings 1994 Ananth Grama, Vipin Kumar , Ahmed H. Sameh : Scalable parallel formulations of the Barnes-Hut method for n -body simulations. SC 1994 : 439-448 Vipin Kumar , Ananth Grama, Nageshwara Rao Vempaty : Scalable Load Balancing Techniques for Parallel Computers. J. Parallel Distrib. Comput. 22 (1): 60-79 (1994) Ananth Grama, Vipin Kumar : Scalability Analysis of Partitioning Strategies for Finite Element Graphs: A Summary of Results. SC 1992 : 83-92 1 [ 11 ] 2 [ 25 ] 3 [ 19 ] [ 24 ] 4 [ 20 ] 5 [ 20 ] 6 [ 4 ] 7 [ 18 ] 8 [ 19 ] [ 24 ] [ 26 ] 9 [ 12 ] 10 [ 4 ] [ 7 ] [ 13 ] 11 [ 13 ] 12 [ 17 ] [ 23 ] [ 27 ] 13 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 15 ] 14 [ 18 ] 15 [ 20 ] 16 [ 16 ] 17 [ 13 ] 18 [ 25 ] 19 [ 10 ] [ 13 ] [ 14 ] [ 17 ] 20 [ 15 ] 21 [ 22 ] 22 [ 3 ] [ 5 ] [ 6 ] [ 8 ] [ 22 ] 23 [ 14 ] [ 22 ] 24 [ 15 ] 25 [ 11 ] [ 12 ] [ 16 ] [ 21 ] [ 27 ] 26 [ 18 ] 27 [ 2 ] 28 [ 12 ] [ 14 ] 29 [ 21 ]  ©2004 Association for Computing Machinery |
