## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Consider a sample of size $n$ from a linear process of dimension $p$ where $n, p \to \infty$, $p/n \to y \in [0, \ \infty).$ Let $\hat{\Gamma}_{u}$ be the sample autocovariance of order $u$.

Arup Bose

Friday, 31 March 2017, 15:00 to 16:00

Consider a sample of size $n$ from a linear process of dimension $p$ where $n, p \to \infty$, $p/n \to y \in [0, \ \infty).$ Let $\hat{\Gamma}_{u}$ be the sample autocovariance of order $u$.

Venkat Anantharam

Thursday, 30 March 2017, 16:00 to 17:00

Many modern data sources arising from social networks, biological data, etc. are best viewed as indexed by combinatorial structures such as graphs, rather than as time series.

K. Gajjar, S. Bhandari

Friday, 24 March 2017, 17:15 to 18:15

The Liars Game is a turn-based two-player game (lets call the two players Alice and Bob). The game is specified by two positive integers $k$ and $n$ which are known to both Alice and Bob.

Virag Shah

Monday, 20 March 2017, 16:00 to 17:00

Online two-sided matching markets such as Q&A forums (e.g. StackOverflow, Quora) and online labour platforms (e.g.

Speaker:

Aditya Nema, TIFR

Friday, 17 March 2017, 17:15 to 18:15

In this talk, we will discuss De Finetti representation theorem on exchangeable probability assignment, that provides an operational definition of the concept of an unknown probability in Bayesian probability theory, where probabilities are taken

Surender Baswana

Friday, 17 March 2017, 16:00 to 17:00

Until 2014, the admissions to the Indian Institutes of Technology (IITs) were conducted separately (based on JEE Advanced ranks) from the admissions to the non-IIT Centrally Funded Technical Institutes (CFTIs) (based on JEE mains ranks).

Surender Baswana

Thursday, 16 March 2017, 14:00 to 15:00

Consider the following problem of single source reachability under failures of vertices or edges. Let $G$ be a given directed graph on n vertices with a designated source vertex $s$, and $k$ be any positive integer. Compute the sparsest subgraph

Monday, 6 March 2017, 10:00 to Tuesday, 7 March 2017, 00:30

STCS Day 2017 is the 2016-17 edition of our annual symposium.

Abhinav Ganesan

Friday, 3 March 2017, 15:30 to 16:30

Design of efficient sampling methodologies to capture the information content in sparse, and thus, "compressible" signals is well known as compressive sensing (CS) in the signal processing community.

Rakesh Venkat

Friday, 24 February 2017, 16:00 to 17:30

A two-player game is an important construct used in proving many hardness of approximation results.

Courses in STCS for the term August-December 2012 will nominally start from Friday 10th August.

Girish Varma, a graduate student in the School of Technology and Computer Science wins the Google India PhD Fellowship 2012 in Algorithms.

- ‹ previous
- 14 of 16
- next ›