default search action
Girish Varma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Furqan Ahmed Shaik, Abhishek Reddy Malreddy, Nikhil Reddy Billa, Kunal Chaudhary, Sunny Manchanda, Girish Varma:
IDD-AW: A Benchmark for Safe and Robust Segmentation of Drive Scenes in Unstructured Traffic and Adverse Weather. WACV 2024: 4602-4611 - [i27]Furqan Ahmed Shaik, Sandeep Nagar, Aiswarya Maturi, Harshit Kumar Sankhla, Dibyendu Ghosh, Anshuman Majumdar, Srikanth Vidapanakal, Kunal Chaudhary, Sunny Manchanda, Girish Varma:
ICPR 2024 Competition on Safe Segmentation of Drive Scenes in Unstructured Traffic and Adverse Weather Conditions. CoRR abs/2409.05327 (2024) - 2023
- [j5]Dharma Teja Vooturi
, Girish Varma, Kishore Kothapalli
Ramanujan bipartite graph products for efficient block sparse neural networks. Concurr. Comput. Pract. Exp. 35(14) (2023) - [c23]Shreevignesh Suriyanarayanan
City-Scale Pollution Aware Traffic Routing by Sampling Max Flows Using MCMC. AAAI 2023: 14496-14503 - [c22]Furqan Ahmed Shaik
Accelerating Computer Vision Tasks on GPUs using Ramanujan Graph Product Framework. COMAD/CODS 2023: 113-117 - [c21]Ashutosh Mishra, Shyam Nandan Rai, Girish Varma, C. V. Jawahar:
Towards Efficient Semantic Segmentation Compression via Meta Pruning. CVIP (3) 2023: 52-64 - [c20]Shreevignesh Suriyanarayanan, Praveen Paruchuri, Girish Varma:
City-scale Pollution Aware Traffic Routing by Sampling Multiple Max Flows Using MCMC. ITSC 2023: 1542-1548 - [c19]Aditya Kallappa, Sandeep Nagar, Girish Varma:
FInC Flow: Fast and Invertible k × k Convolutions for Normalizing Flows. VISIGRAPP (5: VISAPP) 2023: 338-348 - [i26]Aditya Kallappa, Sandeep Nagar, Girish Varma:
FInC Flow: Fast and Invertible k×k Convolutions for Normalizing Flows. CoRR abs/2301.09266 (2023) - [i25]Shreevignesh Suriyanarayanan, Praveen Paruchuri, Girish Varma:
City-scale Pollution Aware Traffic Routing by Sampling Max Flows using MCMC. CoRR abs/2302.14442 (2023) - [i24]Furqan Ahmed Shaik, Abhishek Malreddy, Nikhil Reddy Billa, Kunal Chaudhary, Sunny Manchanda, Girish Varma:
IDD-AW: A Benchmark for Safe and Robust Segmentation of Drive Scenes in Unstructured Traffic and Adverse Weather. CoRR abs/2311.14459 (2023) - 2021
- [c18]Sandeep Nagar, Prateek Pani, Raj Nair, Girish Varma:
Automated Seed Quality Testing System Using GAN and Active Learning. PReMI 2021: 509-519 - [c17]Kshitij Gajjar, Girish Varma, Prerona Chatterjee, Jaikumar Radhakrishnan:
Generalized parametric path problems. UAI 2021: 536-546 - [i23]Prerona Chatterjee
Generalized Parametric Path Problems. CoRR abs/2102.12886 (2021) - [i22]Sandeep Nagar, Marius Dufraisse, Girish Varma:
CInC Flow: Characterizable Invertible 3x3 Convolution. CoRR abs/2107.01358 (2021) - [i21]Sandeep Nagar, Prateek Pani, Raj Nair, Girish Varma:
Automated Seed Quality Testing System using GAN & Active Learning. CoRR abs/2110.00777 (2021) - 2020
- [j4]Amey Bhangale, Prahladh Harsha, Girish Varma:
A Characterization of Hard-to-Cover CSPs. Theory Comput. 16: 1-30 (2020) - [i20]Dharma Teja Vooturi, Girish Varma, Kishore Kothapalli:
Ramanujan Bipartite Graph Products for Efficient Block Sparse Neural Networks. CoRR abs/2006.13486 (2020)
2010 – 2019
- 2019
- [c16]Tarun Kalluri, Girish Varma, Manmohan Chandraker, C. V. Jawahar
Universal Semi-Supervised Semantic Segmentation. ICCV 2019: 5258-5269 - [c15]Dharma Teja Vooturi, Girish Varma, Kishore Kothapalli:
Dynamic Block Sparse Reparameterization of Convolutional Neural Networks. ICCV Workshops 2019: 3046-3053 - [c14]Girish Varma, Anbumani Subramanian, Anoop M. Namboodiri, Manmohan Chandraker, C. V. Jawahar
IDD: A Dataset for Exploring Problems of Autonomous Navigation in Unconstrained Environments. WACV 2019: 1743-1751 - 2018
- [c13]Soham Saha, Girish Varma, C. V. Jawahar:
Improved Visual Relocalization by Discovering Anchor Points. BMVC 2018: 164 - [c12]Nikitha Vallurupalli, Sriharsha Annamaneni, Girish Varma, C. V. Jawahar
Efficient Semantic Segmentation Using Gradual Grouping. CVPR Workshops 2018: 598-606 - [c11]Ameya Prabhu, Girish Varma, Anoop M. Namboodiri:
Deep Expander Networks: Efficient Deep Networks from Graph Theory. ECCV (13) 2018: 20-36 - [c10]Soham Saha, Girish Varma, C. V. Jawahar
Class2Str: End to End Latent Hierarchy Learning. ICPR 2018: 1000-1005 - [c9]Sudhir Yarram, Girish Varma, C. V. Jawahar
City-Scale Road Audit System using Deep Learning. IROS 2018: 635-640 - [i19]Nikitha Vallurupalli, Sriharsha Annamaneni, Girish Varma, C. V. Jawahar, Manu Mathew, Soyeb Nagori:
Efficient Semantic Segmentation using Gradual Grouping. CoRR abs/1806.08522 (2018) - [i18]Soham Saha, Girish Varma, C. V. Jawahar:
Class2Str: End to End Latent Hierarchy Learning. CoRR abs/1808.06675 (2018) - [i17]Soham Saha, Girish Varma, C. V. Jawahar:
Improved Visual Relocalization by Discovering Anchor Points. CoRR abs/1811.04370 (2018) - [i16]Girish Varma, Anbumani Subramanian, Anoop M. Namboodiri, Manmohan Chandraker, C. V. Jawahar:
IDD: A Dataset for Exploring Problems of Autonomous Navigation in Unconstrained Environments. CoRR abs/1811.10200 (2018) - [i15]Sudhir Yarram, Girish Varma, C. V. Jawahar:
City-Scale Road Audit System using Deep Learning. CoRR abs/1811.10210 (2018) - [i14]Tarun Kalluri, Girish Varma
Universal Semi-Supervised Semantic Segmentation. CoRR abs/1811.10323 (2018) - 2017
- [j3]Venkatesan Guruswami, Prahladh Harsha
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes. SIAM J. Comput. 46(1): 132-159 (2017) - [c8]Soham Saha, Girish Varma, C. V. Jawahar
Compressing Deep Neural Networks for Recognizing Places. ACPR 2017: 352-357 - [i13]Ameya Prabhu, Girish Varma, Anoop M. Namboodiri:
Deep Expander Networks: Efficient Deep Networks from Graph Theory. CoRR abs/1711.08757 (2017) - 2015
- [j2]Girish Varma:
Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions. Chic. J. Theor. Comput. Sci. 2015 (2015) - [c7]Amey Bhangale, Ramprasad Saptharishi
On Fortification of Projection Games. APPROX-RANDOM 2015: 497-511 - [c6]Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, Kurt Mehlhorn, Girish Varma:
P. polycephalum Can Compute Shortest Paths. BICT 2015: 587 - [c5]Amey Bhangale, Prahladh Harsha
A Characterization of Hard-to-cover CSPs. CCC 2015: 280-303 - [c4]Irit Dinur
Derandomized Graph Product Results Using the Low Degree Long Code. STACS 2015: 275-287 - [i12]Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat:
On Fortification of General Games. CoRR abs/1504.05556 (2015) - [i11]Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat:
On Fortification of General Games. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c3]Venkatesan Guruswami, Prahladh Harsha
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. STOC 2014: 614-623 - [i10]Manoj Gopalkrishnan, Girish Varma:
Playing games in an uncertain world. CoRR abs/1402.4570 (2014) - [i9]Girish Varma:
A note on reducing uniformity in Khot-Saket hypergraph coloring hardness reductions. CoRR abs/1408.0262 (2014) - [i8]Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma:
Derandomized Graph Product Results using the Low Degree Long Code. CoRR abs/1411.3517 (2014) - [i7]Amey Bhangale, Prahladh Harsha, Girish Varma:
A Characterization of hard-to-cover CSPs. CoRR abs/1411.7747 (2014) - 2013
- [j1]Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma:
Streaming algorithms for language recognition problems. Theor. Comput. Sci. 494: 13-23 (2013) - [i6]Venkatesan Guruswami, Johan Håstad, Prahladh Harsha, Srikanth Srinivasan, Girish Varma:
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. CoRR abs/1311.7407 (2013) - [i5]Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma:
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c2]Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma:
Physarum can compute shortest paths. SODA 2012: 233-240 - 2011
- [i4]Ajesh Babu, Nutan Limaye, Jaikumar Radhakrishnan, Girish Varma:
Streaming algorithms for language recognition problems. CoRR abs/1104.0848 (2011) - [i3]Vincenzo Bonifaci, Kurt Mehlhorn, Girish Varma:
Physarum Can Compute Shortest Paths. CoRR abs/1106.0423 (2011) - 2010
- [c1]Ajesh Babu, Nutan Limaye, Girish Varma:
Streaming Algorithms for Some Problems in Log-Space. TAMC 2010: 94-104 - [i2]Girish Varma:
Conductance and Eigenvalue. CoRR abs/1009.1756 (2010) - [i1]Ajesh Babu, Nutan Limaye, Girish Varma:
Streaming algorithms for some problems in log-space. Electron. Colloquium Comput. Complex. TR10 (2010)
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-10-10 21:13 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: