Abstract: The work is devoted to cooperative and coalitional game-theoretic methods for community detection in networks.The traditional methods for detecting community structure are based on selecting dense subgraphs inside the network.

Limit of the Right-Most Position of a Modified Branching Random Walk

STCS Seminar

Speaker:

Antar Bandyopadhyay

Organisers:

Piyush Srivastava

Time:

Tuesday, 22 October 2019, 16:00 to 17:00

Venue:

A-201 (STCS Seminar Room)

Abstract: In this talk, we consider a modification of the usual Branching Random Walk (BRW), where at the last step we give certain displacements which may be different from the increments.

Distance Matrices of Trees: Invariants, Old and New

STCS Seminar

Speaker:

Apoorva Khare

Organisers:

Hariharan Narayanan

Time:

Tuesday, 22 October 2019, 14:30 to 15:30

Venue:

A-201 (STCS Seminar Room)

Abstract: In 1971, Graham and Pollak showed that if $D_T$ is the distance matrix of a tree $T$ on $n$ nodes, then $\det(D_T)$ depends only on $n$, not $T$.

Multi-Armed Bandits with Non-Stationary Rewards

STCS Student Seminar

Speaker:

Anirban Bhattacharjee, TIFR

Organisers:

Anand Deo

Time:

Friday, 18 October 2019, 17:15 to 18:15

Venue:

A-201 (STCS Seminar Room)

Abstract: In a multi-armed bandit problem a gambler needs to choose at each round one of K arms, each characterized by an unknown reward distribution.

Short course on optimization

Speaker:

Praneeth Netrapalli

Organisers:

Sandeep K Juneja

Time:

Monday, 14 October 2019, 09:30 to Friday, 18 October 2019, 11:30

Venue:

A-201 (STCS Seminar Room)

This course will start with gradient based methods in convex optimization starting with gradient descent, proximal point methods and the use of momentum and randomness.

Project Presentation: Two Problems Related to Small-set Expansion and Reed-Muller Codes.

Project Presentation

Speaker:

Arghya Chakraborty, TIFR

Time:

Friday, 11 October 2019, 18:15 to 19:15

Venue:

A-201 (STCS Seminar Room)

Abstract: This talk will comprise of two parts. In the first half, I shall discuss about Reed-Muller Codes and Reed-Solomon Codes. Basically, we shall prove that Reed-Muller Codes are a subset of Reed-Solomon Codes.

Shortest Paths and Newton Polytopes

STCS Student Seminar

Speaker:

Kshitij Gajjar (IIIT Delhi) and Prerona Chatterjee (STCS, TIFR)

Time:

Friday, 11 October 2019, 17:15 to 18:15

Venue:

A-201 (STCS Seminar Room)

Abstract: In this talk, we will explore a surprising connection between graph theory and convex geometry. We look at graphs whose edge weights are linear forms in $d$ variables.

Streaming Algorithms for Matching Problems

STCS Seminar

Speaker:

Sagar Kale

Organisers:

Umang Bhaskar

Time:

Monday, 7 October 2019, 11:00 to 12:00

Venue:

A-201 (STCS Seminar Room)

Abstract: The advent of big data necessitated design of algorithms that could cope with it. Streaming algorithms are viable for big data because they process their input sequentially and use a small amount of working memory. In

Parallel Machine Scheduling to Minimize Energy Consumption

STCS Student Seminar

Speaker:

Gunjan Kumar, TIFR

Organisers:

Sayantan Chakraborty

Time:

Friday, 4 October 2019, 17:15 to 18:15

Venue:

A-201 (STCS Seminar Room)

Abstract: Given n jobs with release dates, deadlines and processing times we consider the problem of scheduling them on m parallel machines so as to minimize the total energy consumed.

Search form

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Time:

Venue:

Speaker:

Time:

Venue:

Speaker:

Organisers:

Time:

Venue:

Organisers:

Time:

Venue:

Pages