activity
20112021
most citedA Design Methodology for Folded, Pipelined Architectures in VLSI Applications using Projective Space Lattices

3 citations · 8 across the 7 of their papers we have counts for

collaborators

7 papers

cs.CV2021★ 2 cited

SCNet: A Generalized Attention-based Model for Crack Fault Segmentation

Hrishikesh Sharma, Prakhar Pradhan, Balamuralidhar P

Anomaly detection and localization is an important vision problem, having multiple applications. Effective and generic semantic segmentation of anomalous regions on various differe…

quant-ph2021

A Quantum-Classical Hybrid Method for Image Classification and Segmentation

Sayantan Pramanik, M Girish Chandra, C V Sridhar +9

Enormous activity in the Quantum Computing area has resulted in considering them to solve different difficult problems, including those of applied nature, together with classical c…

cs.RO2017

An Efficient Approach to Communication-aware Path Planning for Long-range Surveillance Missions undertaken by UAVs

Hrishikesh Sharma, Tom Sebastian

While using drones for remote surveillance missions, it is mandatory to do path planning of the vehicle since these are pilot-less vehicles. Path planning, whether offline or onlin…

cs.IT2012

Expander-like Codes based on Finite Projective Geometry

Swadesh Choudhary, Hrishikesh Sharma, B. S. Adiga +1

We present a novel error correcting code and decoding algorithm which have construction similar to expander codes. The code is based on a bipartite graph derived from the subsumpti…

cs.AR2011★ 3 cited

A Design Methodology for Folded, Pipelined Architectures in VLSI Applications using Projective Space Lattices

Hrishikesh Sharma, Sachin Patkar

Semi-parallel, or folded, VLSI architectures are used whenever hardware resources need to be saved at design time. Most recent applications that are based on Projective Geometry (P…

math.NA2011★ 3 cited

Finite Projective Geometry based Fast, Conflict-free Parallel Matrix Computations

Shreeniwas Sapre, Hrishikesh Sharma, Abhishek Patil +2

Matrix computations, especially iterative PDE solving (and the sparse matrix vector multiplication subproblem within) using conjugate gradient algorithm, and LU/Cholesky decomposit…

cs.DM2011

Optimal Folding of Data Flow Graphs based on Finite Projective Geometry using Lattice Embedding

Swadesh Choudhary, Hrishikesh Sharma, Sachin Patkar

A number of computations exist, especially in area of error-control coding and matrix computations, whose underlying data flow graphs are based on finite projective-geometry(PG) ba…