3 papers
cs.DS2025
A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
Mumuksh Tayal
The Minimum Vertex Cover problem, a classical NP-complete problem, presents significant challenges for exact solution on large graphs. Fixed-Parameter Tractability (FPT) offers a p…
cs.DC2025
Evaluating Multi-Instance DNN Inferencing on Multiple Accelerators of an Edge Device
Mumuksh Tayal, Yogesh Simmhan
Edge devices like Nvidia Jetson platforms now offer several on-board accelerators -- including GPU CUDA cores, Tensor Cores, and Deep Learning Accelerators (DLA) -- which can be co…
cs.RO2025
RISE: Robust Imitation through Stochastic Encoding
Mumuksh Tayal, Manan Tayal, Ravi Prakash
Ensuring safety in robotic systems remains a fundamental challenge, especially when deploying offline policy-learning methods such as imitation learning in dynamic environments. Tr…