#### Filter Results:

#### Publication Year

1986

2011

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

- Abhiram Ranade, Ben Gomes, Franco Mazzanti, Stephan Murer, Steve Omo-hundro, Thomas Rauber +2 others
- 1993

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)

- Deeparnab Chakrabarty, Vijay V. Vazirani, William Cook, Adam Kalai, Prasad Tetali, Vijay Vazirani +6 others
- 2008

To those who probably will understand the least, but matter the most. iii ACKNOWLEDGEMENTS First and foremost, I thank my advisor, Vijay Vazirani, for his constant support, advice and help throughout these five years. I hope I have imbibed an of the infinite energy with which he does research. Thanks Vijay for everything! I thank Prasad Tetali for patiently… (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)

- Satyen Kale, Abhiram Ranade, Miroslav Dudik, Daniel Hsu, Nikos Karampatziakis, John Langford +1 other
- 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.

- 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

This is to certify that Ms. Moniphal Say was admitted to the candidacy of the M.Tech. Degree and has successfully completed all the courses required for the M.Tech. Programme. The details of the course work done are given below.

- ‹
- 1
- ›