## Speaker:

## Time:

## Venue:

A small random sample of rows/columns of any matrix is a decent proxy for the matrix, provided sampling probabilities are proportional to squared lengths.

Ravi Kannan

Wednesday, 6 June 2018, 17:00 to 18:00

A small random sample of rows/columns of any matrix is a decent proxy for the matrix, provided sampling probabilities are proportional to squared lengths.

Leonard J. Schulman

Monday, 4 June 2018, 16:00 to 17:00

There are several prominent computational problems for which simple iterative methods are widely preferred in practice despite an absence of runtime or performance analysis (or "worse", actual evidence that more sophisticated methods have superior

Rabin Patra

Friday, 1 June 2018, 16:00 to 17:00

Fixed and mobile access networks are still swamped by ever-increasing demand fueled from cloud computing and video.

Vishwas Bhargava

Monday, 28 May 2018, 16:00 to 17:00

We study the problem of deterministic factorization of sparse polynomials.

Speaker:

Anamay Tengse, TIFR

Friday, 25 May 2018, 17:15 to 18:15

Non-commutative algebraic circuits are those in which the variables do not commute under multiplication. Additionally, a circuit is called monotone if it does not use subtractions or negative constants.

Anil Rawat

Friday, 25 May 2018, 16:00 to 17:00

Development in the field of Computer Science is very rapid and it also has wide spread impact on society. Use of Information Technology has become an integral part of everyone’s routine.

Sagar Shrivastav

Friday, 18 May 2018, 17:15 to 18:15

Origami is the art of paper folding. It can also be described mathematically with a set of seven axioms, which are complete. In this talk, we will see the following.

Ashwin Deopurkar

Friday, 11 May 2018, 17:15 to 18:15

This would be an elementary and concrete introduction to classical projective geometry. We'd start with Euclidean geometry of points, lines and circles.

Abhishek Khetan

Friday, 4 May 2018, 17:15 to 18:15

In this talk we will discuss a topological proof of the fundamental theorem of algebra which states that any non-constant polynomial over the field of complex numbers has a complex root.

Speaker:

Neha ., TIFR

Friday, 27 April 2018, 16:00 to 17:00

In this talk, we will discuss the multiplicative weights algorithm and its application in approximately finding the optimal row and column strategies in a two player, zero sum game.

Dr.Hariharan Narayanan joins the School of Technology and Computer Science as a Reader. Hariharan's research interests include manifold learning, randomized algorithms

Dr.Piyush Srivastava joins the School of Technology and Computer Science as a Reader.Piyush's research is on probability in computer science and often concerns question

- ‹ previous
- 4 of 17
- next ›