## Speaker:

## Time:

## Venue:

Abstract: By the year 2020, Fifth Generation (5G) wireless networks are expected to provide a new paradigm over the existing networks.

Vijay K. Bhargava

Monday, 22 February 2016,

10:30 to 11:30

Abstract: By the year 2020, Fifth Generation (5G) wireless networks are expected to provide a new paradigm over the existing networks.

Amey Karkare

Tuesday, 9 February 2016,

16:00 to 17:00

Abstrat: Current garbage collectors leave much heap-allocated data uncollected because they preserve data reachable from a root set.

Speaker:

Phani Raj Lolakapuri, TIFR

Monday, 8 February 2016,

16:00 to 17:00

Abstract: An atomic splittable routing game (ASRG) is a network congestion problem where each player has some finite amount of flow he wants to send in the network, while minimizing his cost.

Speaker:

Phani Raj Lolakapuri, TIFR

Friday, 29 January 2016,

16:00 to 17:00

Abstract: In 1853, Liouville proved a fundamental result concerning approximations of algebraic numbers by rationals, which said one can't approximate algebraic numbers "well" using rationals.

Piyush Srivastava

Friday, 22 January 2016,

11:30 to 12:30

Abstract: Probabilistic graphical models provide a very useful framework for studying several problems across theoretical computer science and statistics.

Speaker:

Aditya Nema, TIFR

Wednesday, 20 January 2016,

15:00 to 16:00

Abstract : Research in quantum information theory suggests that if a quantum channel is used to transmit classical information then the capacity (also referred to as classical capacity) of a quantum channel is super additive.

Speaker:

Gowtham Raghunath Kurri, TIFR

Wednesday, 20 January 2016,

14:00 to 15:00

Abstract: The correlation of a quantum system *A *to an initially correlated system *E * generally decreases when *A *undergoes an evolution separated from *E*.

Rajesh Sundaresan

Tuesday, 19 January 2016,

15:30 to 16:30

Abstract: Kelly, Maulloo, and Tan (1998) proposed a decomposition of a system utility maximisation problem into a network utility maximisation problem, to be solved by a network entity, and a set of decoupled user optimisation problems, to be solv

Anand Louis

Tuesday, 19 January 2016,

11:30 to 12:30

Abstract: Graph-partitioning problems are a central topic of research in the study of algorithms and complexity theory.

Rahul Vaze's paper

- ‹ previous
- 3 of 11
- next ›