default search action
Ramesh C. Agarwal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [j17]Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey Scott Vitter
, Ramesh C. Agarwal:
Efficient Update of Indexes for Dynamically Changing Web Documents. World Wide Web(1): 37-69 (2007) - 2006
- [j16]Ramesh C. Agarwal, Karan Gupta, Shaili Jain, Suchitra Amalapurapu:
An approximation to the greedy algorithm for differential compression. IBM J. Res. Dev. 50(1): 149-166 (2006) - 2004
- [c24]Ramesh C. Agarwal, Suchitra Amalapurapu, Shaili Jain:
An Approximation to the Greedy Algorithm for Differential Compression of Very Large Files. Data Compression Conference 2004: 523 - 2003
- [c23]Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey Scott Vitter
Dynamic maintenance of web indexes using landmarks. WWW 2003: 102-111 - 2002
- [j15]Ramesh C. Agarwal, Robert F. Enenkel, Fred G. Gustavson, Alok Kothari, Mohammad Zubair:
Fast pseudorandom-number generators with modulus 2k or 2k - 1 using fused multiply-ad. IBM J. Res. Dev. 46(1): 97- (2002) - [c22]Mahesh V. Joshi, Ramesh C. Agarwal, Vipin Kumar:
Predicting rare classes: can boosting make any weak learner strong? KDD 2002: 297-306 - [c21]Mahesh V. Joshi, Ramesh C. Agarwal, Vipin Kumar:
Predicting Rare Classes: Comparing Two-Phase Rule Induction to Cost-Sensitive Boosting. PKDD 2002: 237-249 - 2001
- [j14]Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad:
A Tree Projection Algorithm for Generation of Frequent Item Sets. J. Parallel Distributed Comput. 61(3): 350-371 (2001) - [c20]Sriram Padmanabhan, Timothy Malkemus, Ramesh C. Agarwal, Anant Jhingran:
Block Oriented Processing of Relational Database Operations in Modern Computer Architectures. ICDE 2001: 567-574 - [c19]Mahesh V. Joshi, Vipin Kumar, Ramesh C. Agarwal:
Evaluating Boosting Algorithms to Classify Rare Classes: Comparison and Improvements. ICDM 2001: 257-264 - [c18]Ramesh C. Agarwal, Mahesh V. Joshi:
PNrule: A New Framework for Learning Classifier Models in Data Mining (A Case-Study in Network Intrusion Detection). SDM 2001: 1-17 - [c17]Mahesh V. Joshi, Ramesh C. Agarwal, Vipin Kumar:
Mining Needle in a Haystack: Classifying Rare Classes via Two-phase Rule Induction. SIGMOD Conference 2001: 91-102 - [c16]Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey Scott Vitter
Characterizing Web Document Change. WAIM 2001: 133-144 - 2000
- [c15]Anshul Gupta, Pankaj Rohatgi, Ramesh C. Agarwal:
Fast practical algorithms for the Boolean-product-witness-matrix problem. ISSAC 2000: 146-152 - [c14]Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad:
Depth first generation of long patterns. KDD 2000: 108-118
1990 – 1999
- 1999
- [c13]Martin S. Schmookler, Ramesh C. Agarwal, Fred G. Gustavson:
Series Approximation Methods for Divide and Square Root in the Power3(TM) Processor. IEEE Symposium on Computer Arithmetic 1999: 116-123 - [c12]Ramesh C. Agarwal:
A High Performance Parallel Implementation of the 3-D FFT Algorithm. PP 1999 - 1996
- [c11]Ramesh C. Agarwal, Fred G. Gustavson, Mohammad Zubair:
Performance Tuning IBM RS/6000 POWER2 Systems. PARA 1996: 1-13 - [c10]Ramesh C. Agarwal:
A Super Scalar Sort Algorithm for RISC Processors. SIGMOD Conference 1996: 240-246 - 1995
- [j13]Ramesh C. Agarwal, Susanne M. Balle, Fred G. Gustavson, Mahesh V. Joshi, Prasad V. Palkar:
A three-dimensional approach to parallel matrix multiplication. IBM J. Res. Dev. 39(5): 575-582 (1995) - [j12]Ramesh C. Agarwal, Bowen Alpern, Larry Carter, Fred G. Gustavson, David J. Klepacki, Rick Lawrence, Mohammad Zubair:
High-Performance Parallel Implementations of the NAS Kernel Benchmarks on the IBM SP2. IBM Syst. J. 34(2): 263-272 (1995) - [c9]Ramesh C. Agarwal, Fred G. Gustavson, Susanne M. Balle, Mahesh V. Joshi, Prasad V. Palkar:
A High Performance Matrix Manipulation Algorithm for MPPs. PARA 1995: 1-8 - [c8]Ramesh C. Agarwal, Fred G. Gustavson, Mahesh V. Joshi, Mohammad Zubair:
A Scalable Parallel Block Algorithm for Band Cholesky Factorization. PP 1995: 430-435 - 1994
- [j11]Ramesh C. Agarwal, Fred G. Gustavson, Mohammad Zubair:
Improving performance of linear algebra algorithms for dense matrices, using algorithmic prefetch. IBM J. Res. Dev. 38(3): 265-276 (1994) - [j10]Ramesh C. Agarwal, Fred G. Gustavson, Mohammad Zubair:
Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms. IBM J. Res. Dev. 38(5): 563-576 (1994) - [j9]Ramesh C. Agarwal, Fred G. Gustavson, Mohammad Zubair:
A high-performance matrix-multiplication algorithm on a distributed-memory parallel computer, using overlapped communication. IBM J. Res. Dev. 38(6): 673-682 (1994) - [c7]Ramesh C. Agarwal, Fred G. Gustavson, Mohammad Zubair:
A Very High-Performance Algorithm for NAS EP Benchmark. HPCN 1994: 164-169 - [c6]Ramesh C. Agarwal, Fred G. Gustavson, Mohammad Zubair:
A high performance parallel algorithm for 1-D FFT. SC 1994: 34-40 - 1992
- [c5]Ramesh C. Agarwal, Fred G. Gustavson, Mohammad Zubair:
A High Performance Algorithm Using Pre-Processing for the Sparse Matrix-Vector Multiplication. SC 1992: 32-41
1980 – 1989
- 1989
- [j8]Ramesh C. Agarwal, Fred G. Gustavson, Joan McComb, Stanley Schmidt:
Engineering and Scientific Subroutine Library Release 3 for IBM ES/3090 Vector Multiprocessors. IBM Syst. J. 28(2): 345-350 (1989) - [c4]Ramesh C. Agarwal, Fred G. Gustavson:
Vector and parallel algorithms for Cholesky factorization on IBM 3090. SC 1989: 225-233 - 1987
- [j7]Ramesh C. Agarwal, James W. Cooley:
Vectorized mixed radix discrete Fourier transform algorithms. Proc. IEEE 75(9): 1283-1292 (1987) - 1986
- [j6]Ramesh C. Agarwal, James W. Cooley, Fred G. Gustavson, James B. Shearer, Gordon Slishman, Bryant Tuckerman:
New Scalar and Vector Elementary Functions for the IBM System/370. IBM J. Res. Dev. 30(2): 126-144 (1986) - [j5]Ramesh C. Agarwal, James W. Cooley:
Fourier Transform and Convolution Subroutines for the IBM 3090 Vector Facility. IBM J. Res. Dev. 30(2): 145-162 (1986) - [j4]Mrinmoy Bhattacharya, Ramesh C. Agarwal, Suhash C. Dutta Roy:
Bandpass and bandstop recursive filters with low sensitivity. IEEE Trans. Acoust. Speech Signal Process. 34(6): 1485-1492 (1986) - [c3]Ramesh C. Agarwal, James W. Cooley:
An efficient vector implementation of the FFT algorithm on IBM 3090VF. ICASSP 1986: 249-252 - 1985
- [j3]R. Sudhakar, Ramesh C. Agarwal, S. C. Dutta Roy:
Frequency estimation based on iterated autocorrelation function. IEEE Trans. Acoust. Speech Signal Process. 33(1): 70-76 (1985) - 1984
- [j2]Ramesh C. Agarwal, R. Sudhakar, Bhagwati Prasad Agrawal:
Multiplierless Implementations of MF/DTMF Receivers. IEEE Trans. Commun. 32(7): 839-847 (1984) - 1983
- [c2]Ramesh C. Agarwal:
An in-place and in-order WFTA. ICASSP 1983: 190-193 - [c1]Ramesh C. Agarwal, R. Sudhakar:
Multiplier-less design of FIR filters. ICASSP 1983: 209-212
1970 – 1979
- 1976
- [j1]Ramesh C. Agarwal:
Review of "Introduction to Digital Filtering" by Robert E. Bogner and Anthony G. Constantinides. IEEE Trans. Syst. Man Cybern. 6(9): 656 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: