We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
Data sharing between two organizations is common in many application areas e.g. business planing or marketing. Useful global patterns can be discovered from the integrated dataset...
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
d Abstract) Piyoosh Mukhija IIIT Hyderabad Rahul Sawhney IIIT Hyderabad K Madhava Krishna IIIT Hyderabad We present an algorithm for multi robotic exploration of an unknown terrai...
Piyoosh Mukhija, Rahul Sawhney, K. Madhava Krishna