default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandeep Kumar 0002
Person information
- affiliation: Indraprastha Institute of Information Technology (IIIT-D), Delhi, India
Other persons with the same name
- Sandeep Kumar — disambiguation page
- Sandeep Kumar 0001
![[0000-0003-4125-4165]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-4125-4165")
(aka: Sandeep Kumar Poonia) — Jagannath University, Chaksu, Jaipur, Rajasthan, India - Sandeep Kumar 0003 — National Institute of Technology Karnataka, India (and 2 more)
- Sandeep Kumar 0004 — Indian Institute of Technology Roorkee, Department of Computer Science and Engineering, India
- Sandeep Kumar 0005 — Hong Kong University of Science and Technology, Department of Electronics and Communication Engineering, Hong Kong (and 1 more)
- Sandeep Kumar 0006 — Bharat Electronics Ltd., Ghaziabad, India (and 1 more)
- Sandeep Kumar 0007 — University of Hanover, Hannover, Germany
- Sandeep Kumar 0008 — Purdue University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j3]Sandeep Kumar, Koushik Biswas, Ashish Kumar Pandey:
Forecasting Formation of a Tropical Cyclone Using Reanalysis Data. Adv. Artif. Intell. Mach. Learn. 4(3): 2718-2730 (2024)- 2023
- [j2]Sandeep Kumar, Koushik Biswas, Ashish Kumar Pandey:
Will a tropical cyclone make landfall? Neural Comput. Appl. 35(8): 5807-5818 (2023) - 2021
- [j1]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
TanhSoft - Dynamic Trainable Activation Functions for Faster Learning and Better Performance. IEEE Access 9: 120613-120623 (2021)
Conference and Workshop Papers
- 2022
- [c8]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
ErfAct and Pserf: Non-monotonic Smooth Trainable Activation Functions. AAAI 2022: 6097-6105 - [c7]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
Smooth Maximum Unit: Smooth Activation Function for Deep Networks using Smoothing Maximum Technique. CVPR 2022: 784-793 - [c6]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
SAU: Smooth Activation Function Using Convolution with Approximate Identities. ECCV (21) 2022: 313-329 - 2021
- [c5]Sandeep Kumar, Koushik Biswas, Ashish Kumar Pandey:
Prediction of Landfall Intensity, Location, and Time of a Tropical Cyclone. AAAI 2021: 14831-14839 - [c4]Sandeep Kumar, Koushik Biswas, Ashish Kumar Pandey:
Track Prediction of Tropical Cyclones Using Long Short-Term Memory Network. CCWC 2021: 251-257 - [c3]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
EIS - Efficient and Trainable Activation Functions for Better Accuracy and Performance. ICANN (2) 2021: 260-272 - [c2]Sandeep Kumar, Koushik Biswas, Ashish Kumar Pandey:
Predicting Landfall's Location and Time of a Tropical Cyclone Using Reanalysis Data. ICANN (4) 2021: 372-383 - 2018
- [c1]Donghoon Chang, Amit Kumar Chauhan, Sandeep Kumar, Somitra Kumar Sanadhya:
Revocable Identity-Based Encryption from Codes with Rank Metric. CT-RSA 2018: 435-451
Informal and Other Publications
- 2022
- [i11]Sandeep Kumar, Koushik Biswas, Ashish Kumar Pandey:
Forecasting formation of a Tropical Cyclone Using Reanalysis Data. CoRR abs/2212.06149 (2022) - 2021
- [i10]Sandeep Kumar, Koushik Biswas, Ashish Kumar Pandey:
Predicting Landfall's Location and Time of a Tropical Cyclone Using Reanalysis Data. CoRR abs/2103.16108 (2021) - [i9]Sandeep Kumar, Koushik Biswas, Ashish Kumar Pandey:
Prediction of Landfall Intensity, Location, and Time of a Tropical Cyclone. CoRR abs/2103.16180 (2021) - [i8]Koushik Biswas, Sandeep Kumar, Ashish Kumar Pandey:
Intensity Prediction of Tropical Cyclones using Long Short-Term Memory Network. CoRR abs/2107.03187 (2021) - [i7]Koushik Biswas, Sandeep Kumar, Ashish Kumar Pandey:
Tropical cyclone intensity estimations over the Indian ocean using Machine Learning. CoRR abs/2107.05573 (2021) - [i6]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
ErfAct and PSerf: Non-monotonic smooth trainable Activation Functions. CoRR abs/2109.04386 (2021) - [i5]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
SAU: Smooth activation function using convolution with approximate identities. CoRR abs/2109.13210 (2021) - [i4]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
SMU: smooth activation function for deep networks using smoothing maximum technique. CoRR abs/2111.04682 (2021) - 2020
- [i3]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
TanhSoft - a family of activation functions combining Tanh and Softplus. CoRR abs/2009.03863 (2020) - [i2]Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey:
EIS - a family of activation functions combining Exponential, ISRU, and Softplus. CoRR abs/2009.13501 (2020) - 2018
- [i1]Donghoon Chang, Amit Kumar Chauhan, Sandeep Kumar, Somitra Kumar Sanadhya:
Revocable Identity-based Encryption from Codes with Rank Metric. IACR Cryptol. ePrint Arch. 2018: 382 (2018)
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-11-15 20:39 CET 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:
