Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDG. Srinivasaraghavan 0001
Person information
- affiliation: International Institute of Information Technology Bangalore (IIITB), India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i9]Prakhar Mishra, Chaitali Diwan, Srinath Srinivasa, G. Srinivasaraghavan:
AI based approach to Trailer Generation for Online Educational Courses. CoRR abs/2301.03957 (2023)- 2022
- [c23]Prakhar Mishra
, Chaitali Diwan, Srinath Srinivasa, G. Srinivasaraghavan:
A Semi-automatic Approach for Generating Video Trailers for Learning Pathways. AIED (2) 2022: 302-305 - [c22]Ronak Doshi, G. Srinivasaraghavan, Neeraj Bansal, Amit Gupta:
Banking Data Enrichment Pipeline. ICCTA 2022: 42-47 - [c21]Ravi Kiran Reddy Kotlo Budde, Kumar Shubham, Gopalakrishnan Venkatesh, Sriram Gandikota, Sarthak Khoche, Dinesh Babu Jayagopi, Gopalakrishnan Srinivasaraghavan:
One shot learning in StyleALAE: Preserving facial identity during semantic modification. ICVGIP 2022: 16:1-16:7 - [c20]Gopalakrishnan Venkatesh, Abhik Jana, Steffen Remus, Özge Sevgili, Gopalakrishnan Srinivasaraghavan, Chris Biemann:
Using distributional thesaurus to enhance transformer-based contextualized representations for low resource languages. SAC 2022: 845-852 - 2021
- [j4]Prakhar Mishra, Chaitali Diwan, Srinath Srinivasa, G. Srinivasaraghavan:
Automatic Title Generation for Learning Resources and Pathways with Pre-trained Transformer Models. Int. J. Semantic Comput. 15(4): 487-510 (2021) - [c19]Aritra Bhowmick, Meenakshi D'Souza, G. Srinivasa Raghavan:
LipBaB: Computing Exact Lipschitz Constant of ReLU Networks. ICANN (4) 2021: 151-162 - [c18]Kumar Shubham, Gopalakrishnan Venkatesh, Reijul Sachdev, Akshi, Dinesh Babu Jayagopi, G. Srinivasaraghavan:
Learning a Deep Reinforcement Learning Policy Over the Latent Space of a Pre-trained GAN for Semantic Age Manipulation. IJCNN 2021: 1-8 - [c17]Prakhar Mishra, Chaitali Diwan, Srinath Srinivasa, G. Srinivasaraghavan:
Automatic Title Generation for Text with Pre-trained Transformer Language Model. ICSC 2021: 17-24 - [c16]Biswesh Mohapatra, Sumit Bhatia, Raghava Mutharaju, G. Srinivasaraghavan:
EmELvar: A NeuroSymbolic Reasoner for the EL++ Description Logic. SemREC@ISWC 2021: 44-51 - [i8]Nikunj Gupta, G. Srinivasaraghavan, Swarup Kumar Mohalik, Matthew E. Taylor:
HAMMER: Multi-Level Coordination of Reinforcement Learning Agents via Learned Messaging. CoRR abs/2102.00824 (2021) - [i7]Sonal Garg, Sumanth Prabhu, Hemant Misra, G. Srinivasaraghavan:
Unsupervised Contextual Paraphrase Generation using Lexical Control and Reinforcement Learning. CoRR abs/2103.12777 (2021) - [i6]Aritra Bhowmick, Meenakshi D'Souza, G. Srinivasa Raghavan:
LipBaB: Computing exact Lipschitz constant of ReLU networks. CoRR abs/2105.05495 (2021) - [i5]Ravi Kiran Reddy, Kumar Shubham, Gopalakrishnan Venkatesh, Sriram Gandikota, Sarthak Khoche, Dinesh Babu Jayagopi, Gopalakrishnan Srinivasaraghavan:
One-shot domain adaptation for semantic face editing of real world images using StyleALAE. CoRR abs/2108.13876 (2021) - [i4]Biswesh Mohapatra, Sumit Bhatia, Raghava Mutharaju, G. Srinivasaraghavan:
Why Settle for Just One? Extending EL++ Ontology Embeddings with Many-to-Many Relationships. CoRR abs/2110.10555 (2021) - 2020
- [j3]Gopalakrishnan Venkatesh, Aayush Grover, G. Srinivasaraghavan, Shrisha Rao:
MHCAttnNet: predicting MHC-peptide bindings for MHC alleles classes I and II using an attention-based deep neural model. Bioinform. 36(Supplement-1): i399-i406 (2020) - [i3]Kumar Shubham, Gopalakrishnan Venkatesh, Reijul Sachdev, Akshi, Dinesh Babu Jayagopi, G. Srinivasaraghavan:
Learning a Deep Reinforcement Learning Policy Over the Latent Space of a Pre-trained GAN for Semantic Age Manipulation. CoRR abs/2011.00954 (2020)
2010 – 2019
- 2019
- [c15]Rajesh Mangannavar, Gopalakrishnan Srinivasaraghavan:
Learning Agents with Prioritization and Parameter Noise in Continuous State and Action Space. ISNN (1) 2019: 202-212 - 2018
- [c14]Kumar Dheenadayalan, Gopalakrishnan Srinivasaraghavan, V. N. Muralidhara:
Dynamic Control of Storage Bandwidth Using Double Deep Recurrent Q-Network. ICONIP (7) 2018: 222-234 - [c13]Amit Sarkar, G. Srinivasaraghavan:
Contextual Web Summarization: A Supervised Ranking Approach. WWW (Companion Volume) 2018: 105-106 - 2017
- [c12]Kumar Dheenadayalan, Gopalakrishnan Srinivasaraghavan, V. N. Muralidhara:
Policy Gradient Reinforcement Learning for I/O Reordering on Storage Servers. ICONIP (1) 2017: 849-859 - [c11]Kumar Dheenadayalan, Gopalakrishnan Srinivasaraghavan, V. N. Muralidhara:
Self-tuning Filers - Overload Prediction and Preventive Tuning Using Pruned Random Forest. PAKDD (2) 2017: 495-507 - [i2]Daksh Varshneya, G. Srinivasaraghavan:
Human Trajectory Prediction using Spatially aware Deep Attention Models. CoRR abs/1705.09436 (2017) - 2016
- [c10]Kumar Dheenadayalan, V. N. Muralidhara, Gopalakrishnan Srinivasaraghavan:
Storage Load Control Through Meta-Scheduler Using Predictive Analytics. ICDCIT 2016: 75-86 - [c9]Saurabh Deshpande, Kumar Dheenadayalan, G. Srinivasaraghavan, V. N. Muralidhara:
Filer Response Time Prediction Using Adaptively-Learned Forecasting Models Based on Counter Time Series Data. ICMLA 2016: 13-18 - [c8]Aakanksha Bapna, G. Srinivasaraghavan:
On learning mixed Bayesian networks. ICMLC 2016: 392-397 - [c7]Kumar Dheenadayalan, G. Srinivasaraghavan, V. N. Muralidhara:
Pruning a Random Forest by Learning a Learning Algorithm. MLDM 2016: 516-529 - [c6]Kumar Dheenadayalan, V. N. Muralidhara, G. Srinivasaraghavan:
Simulator Prototyping Through Graphical Dependency Modeling. MLDM 2016: 584-598 - [i1]Rahul A. R, G. Srinivasaraghavan:
Phoenix: A Self-Optimizing Chess Engine. CoRR abs/1603.09051 (2016) - 2014
- [c5]Kumar Dheenadayalan, V. N. Muralidhara, Pushpa Datla, G. Srinivasaraghavan, Maulik Shah:
Premonition of storage response class using Skyline ranked Ensemble method. HiPC 2014: 1-10 - [c4]Jyotiska Nath Khasnabish, Mitali Sodhi, Jayati Deshmukh, G. Srinivasaraghavan:
Detecting Programming Language from Source Code Using Bayesian Learning Techniques. MLDM 2014: 513-522
2000 – 2009
- 2000
- [j2]G. Srinivasaraghavan, Asish Mukhopadhyay:
Orthogonal Edge Visibility Graphs of Polygons with Holes. Int. J. Comput. Geom. Appl. 10(1): 79-102 (2000)
1990 – 1999
- 1995
- [c3]R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan:
Tight Bounds for Finding Degrees from the Adjacency Matrix. LATIN 1995: 49-59 - 1994
- [j1]G. Srinivasaraghavan, Asish Mukhopadhyay:
A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons. Discret. Comput. Geom. 12: 65-82 (1994) - 1993
- [c2]G. Srinivasaraghavan, Asish Mukhopadhyay:
On the Notion of Completeness for Reconstruction Algorithms on Visibility Graphs. CCCG 1993: 315-320 - [c1]R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan:
The Complexity of Finding Certain Trees in Tournaments. WADS 1993: 142-150
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 2023-09-27 22:54 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:
