Past Events

Generalized Network Sharing bound and Two-Unicast Networks

Speaker: 

<p>Sudeep Kamath<br /> University of California at Berkeley<br /> Department of Electrical Engineering and<br /> Computer Science<br /> California 94720<br /> United States of America</p>

Organisers: 

Vinod M. Prabhakaran

Time: 

Wednesday, 14 December 2011, 14:00 to 15:00

Venue: 

Webpage: 

http://www.eecs.berkeley.edu/~sudeep/

The talk will be in two parts.

Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas

Speaker: 
Sagnik Mukhopadhyay, TIFR

Time: 

Saturday, 10 December 2011, 11:00 to 12:00

Venue: 

Webpage: 

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

We show lower bounds of $\Omega(\sqrt{n})$ on the randomized communication complexity, respectively, of all $n$-variable read-once Boolean formulas.

Synchrony Induced Brain-like Computing in Artificial Molecular Systems

Speaker: 

<p><a href="http://samurai.nims.go.jp/Anirban_BANDYOPADHYAY-e.html">Anirban Bandyopadhyay</a><br /> National Institute for Materials Science<br /> Surface Characterization Group<br /> Advanced Nano Characterisation Center<br /> 1-2-1 Sengen, Main Bldg, Room-815<br /> Tsukuba, Japan 305-0047</p>

Time: 

Monday, 5 December 2011, 11:00 to 12:00

Venue: 

Nearly 3.5 billion years back microtubule came into being, while unravelling its electronics we found its synchrony induced behavior (1), which enables it to exhibit remarkable electronic properties never seen before.

Towards Coding for Maximum Errors in Interactive Communication

Speaker: 
Swagato Sanyal, TIFR

Time: 

Wednesday, 30 November 2011, 14:00 to 15:00

Venue: 

We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 − epsilon) fraction of all symbols transmitted by the parties are corrupted adversarially, at a cost of increasing th

Approximation Algorithm for Security Games with Costly Resources

Speaker: 

<p><a href="http://www.cs.duke.edu/~bsayan/">Sayan Bhattacharya</a><br /> Duke University<br /> Department of Computer Science<br /> N303, North Building<br /> 304 Research Drive<br /> Durham, NC 27708<br /> United States of America</p>

Time: 

Tuesday, 29 November 2011, 16:00 to 17:00

Venue: 

In recent years, algorithms for computing game-theoretic solutions have been developed for real-world security domains.

Spectral Clustering and Transductive Learning for graphical data

Speaker: 
Tapan Shah, TIFR

Organisers: 

Sagnik Mukhopadhyay

Time: 

Monday, 28 November 2011, 16:00 to 17:00

Venue: 

Suppose we want to cluster scientists into different groups such that in each group scientists have some research interest in common. The data available to us is the coauthor relationships. How do we classify using spectral clustering ?

Pages