Seminar

Automated Analysis of Probabilistic Infinite-state Systems

Speaker: 

Dominik Wojtczak

Organisers: 

Paritosh K Pandya

Time: 

Friday, 10 May 2013, 14:30 to 15:30

Venue: 

Webpage: 

http://cgi.csc.liv.ac.uk/~dominik/

I will survey the state of the art in the automated analysis of several classes of probabilistic infinite-state systems which naturally arise when studying probabilistic programs with recursive calls, queueing systems, population dynamics

Boolean Monotonicity Testing via an Isoperimetry Result on the Directed Hypercube

Speaker: 

Deeparnab Chakrabarty

Organisers: 

Prahladh Harsha

Time: 

Thursday, 2 May 2013, 15:30 to 16:30

Venue: 

Webpage: 

http://research.microsoft.com/en-us/um/people/dechakr/

A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is monotone if $f(x) \geq f(y)$ whenever $x > y$, that is, all coordinates of $x$ dominate those of $y$.

Local Search for Computationally Hard Constraint Satisfaction Problems

Speaker: 

Abdul Sattar

Organisers: 

R K Shyamasundar

Time: 

Monday, 29 April 2013, 10:30 to 11:30

Venue: 

Webpage: 

http://www.griffith.edu.au/professional-page/abdul-sattar

Since the emergence of Artificial Intelligence (AI) as a new field of modern science and engineering  about 6 decades ago, concerted efforts have been made on designing and developing expressively adequate languages to represent knowledge about re

A Model for Equilibrium in Some Service-provider User-set Interactions

Speaker: 

N. Hemachandra

Organisers: 

Sandeep K Juneja

Time: 

Tuesday, 16 April 2013, 15:00 to 16:00

Venue: 

Webpage: 

http://www.ieor.iitb.ac.in/~nh

We propose a model for interaction between an user-set (market) and a service-provider (firm) when the offered demand is sensitive to the offered Quality of Service.

Computation and Secrecy in Multiterminal Systems

Speaker: 

Himanshu Tyagi

Organisers: 

Vinod M. Prabhakaran

Time: 

Tuesday, 2 April 2013, 11:00 to 12:00

Venue: 

Webpage: 

http://www.ece.umd.edu/~tyagi/homepage.html

Information theoretic secrecy provides a framework for exploring schemes that guarantee provable unconditional security in network systems. This talk explores innate structural connections that exist between the information theoretic notion of mul

On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity

Speaker: 

Jakob Nordström

Organisers: 

Arkadev Chattopadhyay

Time: 

Wednesday, 13 March 2013, 15:30 to 16:30

Venue: 

Webpage: 

http://www.csc.kth.se/~jakobn/

An active line of research in proof complexity over the last decade has been the study of proof space and trade-offs between size and space.

Pages

Subscribe to RSS - Seminar