#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1986

2015

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- Abhiram Ranade, Ben Gomes, +5 authors Poh Hean Lee
- 1993

- A. Ranade
- IEEE Trans. Communications
- 1989

In this report we study the oating random walk method for Capacitance Estimation in VLSI circuits. The aspects studied are the time complexity of the algorithm, error reduction and ways to speed the algorithm. For algorithms such as these, most of the analysis done in the literature is based only on experimental results. We take a theoretical approach… (More)

- Abhiram Ranade
- 2010

We have been considering the problem of designing a non-blocking network , i.e. a network in which we can simultaneously connect every input i to an output (i) where can be any permutation. We considered two candidates for this: the Butter BLOCKINy and the Benes. On the Butter BLOCKINy we saw that for some permutations it was indeed possible to make all N… (More)

- Abhiram Ranade
- 2007

In this work we consider the Single Track Train Scheduling Problem. The problem consists in scheduling a set of trains from opposite sides along a single track. The track passes intermediate stations and the trains are only allowed to pass each other at those stations. This problem has a close relation to minimizing the makespan in a job shop scheduling… (More)

- Abhiram Ranade
- 2011

A graph is planar if it can be drawn in the plane without edges crossing. More formally, a graph is planar if it has an embedding in the plane, in which each vertex is mapped to a distinct point P (v), and edge (u, v) to simple curves connecting P (u), P (v), such that curves intersect only at their endpoints. graph which each partition having 3 vertices.… (More)

- A. Ranade
- ICC
- 1986

- Satyen Kale, Abhiram Ranade, +4 authors Lev Reyzin
- 2011

My current research is the design of efficient and practical algorithms for fundamental problems in Machine Learning and Optimization. More specifically, I am interested in decision making under uncertainty, statistical learning theory, combinatorial optimization, and convex optimization techniques such as linear and semidefinite programming.

Acknowledgement I would like to thank my guide, Prof. Soumen Chakrabarti for the consistent motivation and direction he has fed into my work. I would also like to thank Prof. Abhiram Ranade for his invaluable inputs and suggestions regarding the Reverse Push algorithm. My thanks to Prof. Sohoni who pitched in at the right time with sound advice. Finally, I… (More)