default search action
Soumya Roy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Soumya Roy, Vinay Kumar Verma, Deepak Gupta:
Efficient Expansion and Gradient Based Task Inference for Replay Free Incremental Learning. WACV 2024: 1154-1164 - [i3]Subhasis Dasgupta, Soumya Roy, Jaydip Sen:
Analyzing Consumer Reviews for Understanding Drivers of Hotels Ratings: An Indian Perspective. CoRR abs/2408.04369 (2024) - 2023
- [j8]Praveen Puram
, Soumya Roy, Deepak Srivastav, Anand Gurumurthy:
Understanding the effect of contextual factors and decision making on team performance in Twenty20 cricket: an interpretable machine learning approach. Ann. Oper. Res. 325(1): 261-288 (2023) - [i2]Soumya Roy, Vinay Kumar Verma, Deepak Gupta:
Efficient Expansion and Gradient Based Task Inference for Replay Free Incremental Learning. CoRR abs/2312.01188 (2023) - 2021
- [c18]Bharat Bhusan Sau, Soumya Roy, Vinay P. Namboodiri, Raghu Sesha Iyengar:
Deep Knowledge Distillation using Trainable Dense Attention. BMVC 2021: 72 - [c17]Soumya Roy, Bharat Bhusan Sau:
Can Selfless Learning improve accuracy of a single classification task? WACV 2021: 4043-4051 - 2020
- [j7]Jimut Bahan Chakrabarty
Optimum life test plan for Type-I hybrid censored Weibull distributed products sold under general rebate warranty. Int. J. Prod. Res. 58(18): 5693-5706 (2020)
2010 – 2019
- 2018
- [c16]Soumya Roy, Asim Unmesh, Vinay P. Namboodiri:
Deep active learning for object detection. BMVC 2018: 91 - 2017
- [j6]Soumya Roy
Inference based on progressive Type I interval censored data from log-normal distribution. Commun. Stat. Simul. Comput. 46(8): 6495-6512 (2017) - [j5]Soumya Roy
Bayesian optimum life testing plans under progressive Type-I interval censoring scheme. Qual. Reliab. Eng. Int. 33(8): 2727-2737 (2017) - [c15]Madhukar Anand, Ramesh Subrahmaniam, Soumya Roy, Radhakrishna Valiveti:
Extending segment routing into optical networks. OFC 2017: 1-3 - 2016
- [j4]Chiranjit Mukhopadhyay, Soumya Roy
Bayesian accelerated life testing under competing log-location-scale family of causes of failure. Comput. Stat. 31(1): 89-119 (2016) - [i1]Soumya Roy, Vinay P. Namboodiri, Arijit Biswas:
Active learning with version spaces for object detection. CoRR abs/1611.07285 (2016) - 2015
- [c14]Onur Turkcu, Soumya Roy, Abishek Gopalan, Matthew Mitchell, Biao Lu:
Comparing networks with capacity-fixed and spectrally-fixed line modules implementing multiple coherent modulations. ECOC 2015: 1-3 - [c13]Srivatsan Balasubramanian, Steven J. Hand, Pravin Mahajan, Serge Melle, Soumya Roy, Thirukumaran Velusamy, Jay Perrett, Omar Al Assil:
A novel IPoOTN packet-optical architecture for economical and fast protection of link/IP port failures. OFC 2015: 1-3 - [c12]Soumya Roy
DMBRLE: A lossless compression algorithm for solar irradiance data acquisition. ReTIS 2015: 450-454 - 2014
- [j3]Geoff Bennett, Kuang-Tsan Wu, Anuj Malik, Soumya Roy, Ahmed Awadalla:
A review of high-speed coherent transmission technologies for long-haul DWDM transmission at 100g and beyond. IEEE Commun. Mag. 52(10): 102-110 (2014) - [j2]Biswabrata Pradhan, Soumya Roy
Inference for the Component and System Lifetime Distribution of a k-unit Parallel System Based on System Data. Commun. Stat. Simul. Comput. 43(1): 45-61 (2014) - [c11]Soumya Roy, Srivatsan Balasubramanian, Parameshwara B. V. Gowda, Sudhindra A. Kota:
Doing more with less: Multiple-link failure resiliency using shared mesh protection. IEEE ANTS 2014: 1-3 - [c10]Soumya Roy, Sudhindra A. Kota, Onur Turkcu, Steve Hand, Krish Verma, Rajan Rao:
Network cost savings and service differentiation using priority-driven sub-50ms shared mesh protection. OFC 2014: 1-3 - [c9]Soumya Roy, Onur Turkcu, Steven J. Hand, Serge Melle:
Variation of OTN switching benefits in real-world networks based on network and traffic connectivity. OFC 2014: 1-3 - 2013
- [c8]Soumya Roy, Anuj Malik, Abhijeet Deore, Satyajeet Ahuja, Onur Turkcu, Steve Hand, Serge Melle:
Evaluating efficiency of multi-layer switching in future optical transport networks. OFC/NFOEC 2013: 1-3
2000 – 2009
- 2007
- [c7]Shantanu Biswas, Soumya Roy:
A shared ICT infrastructure for Indian SME clusters. ICTD 2007: 1-11 - [c6]Soumya Roy, Shantanu Biswas:
Collaborative ICT for Indian business clusters. WWW 2007: 1115-1116 - 2005
- [j1]J. J. Garcia-Luna-Aceves, Soumya Roy:
On-demand loop-free routing with link vectors. IEEE J. Sel. Areas Commun. 23(3): 533-546 (2005) - 2004
- [c5]Jose Joaquin Garcia-Luna-Aceves, Soumya Roy:
On-Demand Loop-Free Routing with Link Vectors. ICNP 2004: 140-150 - 2002
- [c4]Soumya Roy, Jose Joaquin Garcia-Luna-Aceves:
Node-centric hybrid routing for ad-hoc wireless extensions of the Internet. GLOBECOM 2002: 183-187 - [c3]Soumya Roy, J. J. Garcia-Luna-Aceves:
An efficient path selection algorithm for on-demand link-state hop-by-hop routing. ICCCN 2002: 561-564 - [c2]Soumya Roy, J. J. Garcia-Luna-Aceves:
Node-centric hybrid routing for ad hoc networks. MOBIWAC 2002: 63-71 - 2001
- [c1]Soumya Roy, J. J. Garcia-Luna-Aceves:
Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks. INFOCOM 2001: 1172-1181
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-09-28 02:23 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: