Girish Varma

Orcid: 0000-0003-2096-3157

According to our database1, Girish Varma authored at least 31 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
IDD-AW: A Benchmark for Safe and Robust Segmentation of Drive Scenes in Unstructured Traffic and Adverse Weather.
CoRR, 2023

Ramanujan bipartite graph products for efficient block sparse neural networks.
Concurr. Comput. Pract. Exp., 2023

FInC Flow: Fast and Invertible k × k Convolutions for Normalizing Flows.
Proceedings of the 18th International Joint Conference on Computer Vision, 2023

City-scale Pollution Aware Traffic Routing by Sampling Multiple Max Flows Using MCMC.
Proceedings of the 25th IEEE International Conference on Intelligent Transportation Systems, 2023

Accelerating Computer Vision Tasks on GPUs using Ramanujan Graph Product Framework.
Proceedings of the 6th Joint International Conference on Data Science & Management of Data (10th ACM IKDD CODS and 28th COMAD), 2023

City-Scale Pollution Aware Traffic Routing by Sampling Max Flows Using MCMC.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2021
Automated Seed Quality Testing System using GAN & Active Learning.
CoRR, 2021

CInC Flow: Characterizable Invertible 3x3 Convolution.
CoRR, 2021

Generalized parametric path problems.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

2020
A Characterization of Hard-to-Cover CSPs.
Theory Comput., 2020

2019
IDD: A Dataset for Exploring Problems of Autonomous Navigation in Unconstrained Environments.
Proceedings of the IEEE Winter Conference on Applications of Computer Vision, 2019

Dynamic Block Sparse Reparameterization of Convolutional Neural Networks.
Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision Workshops, 2019

Universal Semi-Supervised Semantic Segmentation.
Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision, 2019

2018
City-Scale Road Audit System using Deep Learning.
Proceedings of the 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2018

Class2Str: End to End Latent Hierarchy Learning.
Proceedings of the 24th International Conference on Pattern Recognition, 2018

Deep Expander Networks: Efficient Deep Networks from Graph Theory.
Proceedings of the Computer Vision - ECCV 2018, 2018

Efficient Semantic Segmentation Using Gradual Grouping.
Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2018

Improved Visual Relocalization by Discovering Anchor Points.
Proceedings of the British Machine Vision Conference 2018, 2018

2017
Compressing Deep Neural Networks for Recognizing Places.
Proceedings of the 4th IAPR Asian Conference on Pattern Recognition, 2017

2015
On Fortification of General Games.
Electron. Colloquium Comput. Complex., 2015

Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions.
Chic. J. Theor. Comput. Sci., 2015

Derandomized Graph Product Results Using the Low Degree Long Code.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

P. polycephalum Can Compute Shortest Paths.
Proceedings of the BICT 2015, 2015

On Fortification of Projection Games.
Proceedings of the Approximation, 2015

2014
A note on reducing uniformity in Khot-Saket hypergraph coloring hardness reductions.
CoRR, 2014

Playing games in an uncertain world.
CoRR, 2014

2013
Streaming algorithms for language recognition problems.
Theor. Comput. Sci., 2013

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes.
Electron. Colloquium Comput. Complex., 2013

2012
Physarum can compute shortest paths.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010
Streaming algorithms for some problems in log-space.
Electron. Colloquium Comput. Complex., 2010

Conductance and Eigenvalue
CoRR, 2010


  Loading...