default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaptarshi Sinha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Saptarshi Sinha, Alexandros Stergiou, Dima Damen:
Every Shot Counts: Using Exemplars for Repetition Counting in Videos. CoRR abs/2403.18074 (2024)- 2023
- [c4]Onkar Krishna, Hiroki Ohashi, Saptarshi Sinha:
MILA: Memory-Based Instance-Level Adaptation for Cross-Domain Object Detection. BMVC 2023: 192 - [c3]Toby Perrett, Saptarshi Sinha, Tilo Burghardt, Majid Mirmehdi, Dima Damen:
Use Your Head: Improving Long-Tail Video Recognition. CVPR 2023: 2415-2425 - [c2]Saptarshi Sinha, Hiroki Ohashi:
Difficulty-Net: Learning to Predict Difficulty for Long-Tailed Recognition. WACV 2023: 6433-6442 - [i9]Toby Perrett, Saptarshi Sinha, Tilo Burghardt, Majid Mirmehdi, Dima Damen:
Use Your Head: Improving Long-Tail Video Recognition. CoRR abs/2304.01143 (2023) - [i8]Onkar Krishna, Hiroki Ohashi, Saptarshi Sinha:
MILA: Memory-Based Instance-Level Adaptation for Cross-Domain Object Detection. CoRR abs/2309.01086 (2023) - 2022
- [j2]Saptarshi Sinha
, Hiroki Ohashi, Katsuyuki Nakamura:
Class-Difficulty Based Methods for Long-Tailed Visual Recognition. Int. J. Comput. Vis. 130(10): 2517-2531 (2022) - [i7]Saptarshi Sinha, Hiroki Ohashi, Katsuyuki Nakamura:
Class-Difficulty Based Methods for Long-Tailed Visual Recognition. CoRR abs/2207.14499 (2022) - [i6]Saptarshi Sinha, Hiroki Ohashi:
Difficulty-Net: Learning to Predict Difficulty for Long-Tailed Recognition. CoRR abs/2209.02960 (2022) - 2021
- [j1]Saptarshi Sinha, Sourabh Samaddar, Sujoy K. Das Gupta, Soumen Roy:
Network approach to mutagenesis sheds insight on phage resistance in mycobacteria. Bioinform. 37(2): 213-220 (2021) - [i5]Deep Nath, Saptarshi Sinha, Soumen Roy:
Scale-free networks may not necessarily witness cooperation. CoRR abs/2101.01167 (2021) - 2020
- [c1]Saptarshi Sinha, Hiroki Ohashi, Katsuyuki Nakamura:
Class-Wise Difficulty-Balanced Loss for Solving Class-Imbalance. ACCV (6) 2020: 549-565 - [i4]Saptarshi Sinha, Deep Nath, Soumen Roy:
Topology dependent payoffs can lead to escape from prisoner's dilemma. CoRR abs/2006.14593 (2020) - [i3]Saptarshi Sinha, Deep Nath, Soumen Roy:
Mass testing and proactiveness affect epidemic spreading. CoRR abs/2008.10387 (2020) - [i2]Saptarshi Sinha, Hiroki Ohashi, Katsuyuki Nakamura:
Class-Wise Difficulty-Balanced Loss for Solving Class-Imbalance. CoRR abs/2010.01824 (2020)
2010 – 2019
- 2014
- [i1]Soumya Jyoti Banerjee, Saptarshi Sinha, Soumen Roy:
Slow poisoning and destruction of networks: edge proximity and its implications for biological and infrastructure networks. CoRR abs/1409.8268 (2014)
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-04-24 23:12 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:
