| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Rahul Shah Reynold Cheng , Yuni Xia , Sunil Prabhakar , Rahul Shah: Change Tolerant Indexing for Constantly Evolving Data. ICDE 2005 : 391-402 Thanaa M. Ghanem , Rahul Shah, Mohamed F. Mokbel , Walid G. Aref , Jeffrey Scott Vitter : Bulk Operations for Space-Partitioning Trees. ICDE 2004 : 29-41 Ihab F. Ilyas , Rahul Shah, Walid G. Aref , Jeffrey Scott Vitter , Ahmed K. Elmagarmid : Rank-aware Query Optimization. SIGMOD Conference 2004 : 203-214 Rahul Shah, Peter J. Varman , Jeffrey Scott Vitter : Online algorithms for prefetching and caching on parallel disks. SPAA 2004 : 255-264 S. Muthukrishnan , Rahul Shah, Jeffrey Scott Vitter : Mining Deviants in Time Series Data Streams. SSDBM 2004 : 41-50 Reynold Cheng , Yuni Xia , Sunil Prabhakar , Rahul Shah, Jeffrey Scott Vitter : Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data. VLDB 2004 : 876-887 Rahul Shah, Zulfikar Ramzan , Ravi Jain , Raghu Dendukuri , Farooq Anjum : Efficient Dissemination of Personalized Information Using Content-Based Multicast. IEEE Trans. Mob. Comput. 3 (4): 394-408 (2004) Joel Grodstein , Rachid Rayess , Tad Truex , Linda Shattuck , Sue Lowell , Dan Bailey , David Bertucci , Gabriel Bischoff , Daniel E. Dever , Mike Gowan , Roy Lane , Brian Lilly , Krishna Nagalla , Rahul Shah, Emily Shriver , Shi-Huang Yin , Shannon V. Morton : Power and CAD considerations for the 1.75mbyte, 1.2ghz L2 cache on the alpha 21364 CPU. ACM Great Lakes Symposium on VLSI 2002 : 1-6 Rahul Shah, Ravi Jain , Farooq Anjum : Efficient Dissemination of Personalized Information Using Content-Based Multicast. INFOCOM 2002 Rahul Shah, Martin Farach-Colton : Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. SODA 2002 : 108-115 Stefan Langerman , Sachin Lodha , Rahul Shah: Algorithms for Efficient Filtering in Content-Based Multicast. ESA 2001 : 428-439 Rahul Shah, Martin Farach-Colton : On the midpath tree conjuncture: a counter-example. SODA 2001 : 208-209 1 [ 4 ] [ 6 ] 2 [ 10 ] [ 11 ] 3 [ 5 ] 4 [ 5 ] 5 [ 5 ] 6 [ 7 ] [ 12 ] 7 [ 6 ] 8 [ 5 ] 9 [ 10 ] 10 [ 1 ] [ 3 ] 11 [ 11 ] 12 [ 5 ] 13 [ 5 ] 14 [ 10 ] 15 [ 4 ] [ 6 ] 16 [ 5 ] 17 [ 2 ] 18 [ 5 ] 19 [ 2 ] 20 [ 5 ] 21 [ 11 ] 22 [ 5 ] 23 [ 8 ] 24 [ 5 ] 25 [ 7 ] [ 12 ] 26 [ 6 ] 27 [ 5 ] 28 [ 5 ] 29 [ 5 ] 30 [ 5 ] 31 [ 9 ] 32 [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] 33 [ 7 ] [ 12 ] 34 [ 5 ]  ©2005 Association for Computing Machinery |
