default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahesh V. Joshi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[c18]Mahesh V. Joshi, Vipin Kumar:
CREDOS: Classification Using Ripple Down Structure (A Case for Rare Classes). SDM 2004: 321-332- 2003
- [c17]Huaiyu Zhu, Shivakumar Vaithyanathan, Mahesh V. Joshi:
Topic Learning from Few Examples. PKDD 2003: 483-494 - 2002
- [c16]Mahesh V. Joshi:
On Evaluating Performance of Classifiers for Rare Classes. ICDM 2002: 641-644 - [c15]Mahesh V. Joshi, Ramesh C. Agarwal, Vipin Kumar:
Predicting rare classes: can boosting make any weak learner strong? KDD 2002: 297-306 - [c14]Mahesh V. Joshi, Ramesh C. Agarwal, Vipin Kumar:
Predicting Rare Classes: Comparing Two-Phase Rule Induction to Cost-Sensitive Boosting. PKDD 2002: 237-249 - [c13]Vipin Kumar, Mahesh V. Joshi, Eui-Hong Han, Pang-Ning Tan
, Michael S. Steinbach:
High Performance Data Mining. VECPAR 2002: 111-125 - 2001
- [c12]Mahesh V. Joshi, Vipin Kumar, Ramesh C. Agarwal:
Evaluating Boosting Algorithms to Classify Rare Classes: Comparison and Improvements. ICDM 2001: 257-264 - [c11]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 - [c10]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
1990 – 1999
- 1999
- [c9]Mahesh V. Joshi, Eui-Hong Han, George Karypis, Vipin Kumar:
Efficient Parallel Algorithms for Mining Associations. Large-Scale Parallel Data Mining 1999: 83-126 - [c8]Mahesh V. Joshi, George Karypis, Vipin Kumar, Anshul Gupta, Fred G. Gustavson:
PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver. PP 1999 - 1998
- [j2]Anshul Gupta, Fred G. Gustavson, Mahesh V. Joshi, Sivan Toledo:
The Design, Implementation, and Evaluation of a Symmetric Banded Linear Solver for Distributed-Memory Parallel Computers. ACM Trans. Math. Softw. 24(1): 74-101 (1998) - [c7]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 - [c6]Anshul Gupta, Mahesh V. Joshi, Vipin Kumar:
WSSMP: A High-Performance Serial and Parallel Symmetric Sparse Linear Solver. PARA 1998: 182-194 - 1997
- [c5]Mahesh V. Joshi, Anshul Gupta, George Karypis, Vipin Kumar:
A high performance two dimensional scalable parallel algorithm for solving sparse triangular systems. HiPC 1997: 137-143 - [c4]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. PP 1997 - 1996
- [c3]Anshul Gupta, Fred G. Gustavson, Mahesh V. Joshi, Sivan Toledo:
The Design, Implementation, and Evaluation of a Banded Linear Solver for Distributed-Memory Parallel Computers. PARA 1996: 328-340 - 1995
- [j1]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) - [c2]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 - [c1]Ramesh C. Agarwal, Fred G. Gustavson, Mahesh V. Joshi, Mohammad Zubair:
A Scalable Parallel Block Algorithm for Band Cholesky Factorization. PP 1995: 430-435
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 22:20 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:
