D-405 (D-Block Seminar Room)

Throughput-Optimal Algorithms for Generalized Flow Problems

Speaker: 

Abhishek Sinha

Organisers: 

Rahul Vaze

Time: 

Friday, 20 January 2017, 11:30 to 13:00

Venue: 

Webpage: 

http://web.mit.edu/~sinhaa/

One of the fundamental problems in Computer Networking is to efficiently transport packets belonging to different sessions, such as unicast, broadcast, multicast and anycast, collectively known as the generalized flows.

Improved Sample Complexity Estimates for Stochastic Approximation Algorithms

Speaker: 
Gugan Thoppe, TIFR

Organisers: 

Tulasi mohan Molli

Time: 

Thursday, 30 April 2015, 14:00 to 15:30

Venue: 

Webpage: 

https://sites.google.com/site/gugancth/

Abstract: The Alexeev's perturbation theory gives a method to compare solutions of a perturbed ordinary differential equation (ODEs) with that of the unperturbed one.

Broadcast Channels and Their Capacity Under Noisy Feedback

Speaker: 
Vinod M. Prabhakaran, TIFR

Organisers: 

Rahul Vaze

Time: 

Monday, 20 April 2015, 16:00 to 17:00

Venue: 

Webpage: 

http://www.tcs.tifr.res.in/~vinodmp/

Abstract: Broadcast channels model the downlink in a wireless network, i.e., the link from a base station transmitter to several receivers. The broadcast channel model was proposed by Tom Cover in 1972.

Pure State Transformations Under Local Operations and Classical Communication (LOCC)

Speaker: 
Gowtham Raghunath Kurri, TIFR

Organisers: 

Phani Raj Lolakapuri

Time: 

Thursday, 26 March 2015, 14:00 to 15:30

Venue: 

Abstract: We discuss Nielsen's result(1999) which characterizes pure state transformation under LOCC by connecting the quantum entanglement to the algebraic theory of majorization.

Old and New PCP Constructions

Speaker: 
Prahladh Harsha, TIFR

Organisers: 

Rahul Vaze

Time: 

Tuesday, 17 March 2015, 16:00 to 17:00

Venue: 

Webpage: 

http://www.tcs.tifr.res.in/~prahladh/

Abstract: The PCP theorem (AS,ALMSS 1991) guarantees that every NP language has a probabilistically checkable proof (PCP) system allowing a verifier to check a witness very efficiently using randomness, and allowing for small error.

Topology in Combinatorics: The Borsuk-Ulam Theorem

Speaker: 
Rakesh Venkat, TIFR

Organisers: 

Tulasi mohan Molli

Time: 

Thursday, 12 March 2015, 14:00 to 15:00

Venue: 

Webpage: 

http://www.tcs.tifr.res.in/~rakesh/

Abstract: We will see an application of topology to prove combinatorial results. The Borsuk-Ulam theorem states that any continuous function f from the surface of the (n+1)-sphere to R^n should have a point x on the sphere such that f(x) = f(-x).

Pages

Subscribe to RSS - D-405 (D-Block Seminar Room)