default search action
Sangamesh Kodge
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Sangamesh Kodge, Gobinda Saha, Kaushik Roy:
Deep Unlearning: Fast and Efficient Gradient-free Class Forgetting. Trans. Mach. Learn. Res. 2024 (2024) - [i8]Sangamesh Kodge, Deepak Ravikumar, Gobinda Saha, Kaushik Roy:
Verifix: Post-Training Correction to Improve Label Noise Robustness with Verified Samples. CoRR abs/2403.08618 (2024) - 2023
- [j7]Deepak Ravikumar
, Sangamesh Kodge
Intra-Class Mixup for Out-of-Distribution Detection. IEEE Access 11: 25968-25981 (2023) - [j6]Deepak Ravikumar
TREND: Transferability-Based Robust ENsemble Design. IEEE Trans. Artif. Intell. 4(3): 534-548 (2023) - [j5]Sai Aparna Aketi, Sangamesh Kodge, Kaushik Roy:
Neighborhood Gradient Mean: An Efficient Decentralized Learning Method for Non-IID Data. Trans. Mach. Learn. Res. 2023 (2023) - [i7]Sangamesh Kodge, Gobinda Saha, Kaushik Roy:
Deep Unlearning: Fast and Efficient Training-free Approach to Controlled Forgetting. CoRR abs/2312.00761 (2023) - 2022
- [j4]Sai Aparna Aketi
Low precision decentralized distributed training over IID and non-IID data. Neural Networks 155: 451-460 (2022) - [i6]Sai Aparna Aketi, Sangamesh Kodge, Kaushik Roy:
Neighborhood Gradient Clustering: An Efficient Decentralized Learning Method for Non-IID Data Distributions. CoRR abs/2209.14390 (2022) - 2021
- [i5]Sangamesh Kodge, Kaushik Roy:
BERMo: What can BERT learn from ELMo? CoRR abs/2110.15802 (2021) - [i4]Sai Aparna Aketi, Sangamesh Kodge, Kaushik Roy:
Low Precision Decentralized Distributed Training with Heterogeneous Data. CoRR abs/2111.09389 (2021) - 2020
- [j3]Amogh Agrawal
CASH-RAM: Enabling In-Memory Computations for Edge Inference Using Charge Accumulation and Sharing in Standard 8T-SRAM Arrays. IEEE J. Emerg. Sel. Topics Circuits Syst. 10(3): 295-305 (2020) - [j2]Amogh Agrawal
Erratum to "CASH-RAM: Enabling In-Memory Computations for Edge Inference Using Charge Accumulation and Sharing in Standard 8T-SRAM Arrays". IEEE J. Emerg. Sel. Topics Circuits Syst. 10(4): 588 (2020) - [j1]Mustafa Fayez Ali
IMAC: In-Memory Multi-Bit Multiplication and ACcumulation in 6T SRAM Array. IEEE Trans. Circuits Syst. I Regul. Pap. 67-I(8): 2521-2531 (2020) - [i3]Mustafa Fayez Ali, Akhilesh Jaiswal, Sangamesh Kodge, Amogh Agrawal, Indranil Chakraborty, Kaushik Roy:
IMAC: In-memory multi-bit Multiplication andACcumulation in 6T SRAM Array. CoRR abs/2003.12558 (2020) - [i2]Deepak Ravikumar, Sangamesh Kodge, Isha Garg, Kaushik Roy:
TREND: Transferability based Robust ENsemble Design. CoRR abs/2008.01524 (2020) - [i1]Deepak Ravikumar, Sangamesh Kodge, Isha Garg, Kaushik Roy:
Exploring Vicinal Risk Minimization for Lightweight Out-of-Distribution Detection. CoRR abs/2012.08398 (2020)
2010 – 2019
- 2017
- [c2]Sangamesh Kodge, Himanshu Chaudhary, Mrigank Sharad:
Low Power Image Acquisition Scheme Using On-Pixel Event Driven Halftoning. ISVLSI 2017: 260-265 - [c1]Himanshu Chaudhary, Sangamesh Kodge, Mrigank Sharad:
Digitally assisted analog processing unit for MPG based wearable device. MWSCAS 2017: 257-260
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-08-10 00:33 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: