Invited Talks


Date : April 19, 2044
Randomized

Prof. Subramanian, IMSc Chennai

Date : March 4, 2016
Introduction to Computational Intelligence

Prof. Sushmita Mitra
Date : February 2, 2016
From Vision-Realistic Rendering to Vision Correcting Displays

Prof. Brian Barsky, Professor of Computer Science and Affiliate Professor of Optometry, at the University of California Berkeley, USA

Lorem ipsum dolor sit amet consectetur, adipisicing elit. Ut dolorum iste nisi nemo voluptatum minima maiores et reprehenderit explicabo quam! Unde, totam recusandae dolor aperiam vel pariatur saepe facilis deleniti!

Lorem ipsum dolor sit amet consectetur adipisicing elit. Veritatis sunt natus dolorum ratione. Saepe, reprehenderit perferendis? Rerum hic nobis, necessitatibus, modi quidem sed minus, esse officiis numquam animi at amet.

Date : January 8, 2066
Digital iT industry

Gaurav

Date : November 4, 2015
Delegation games: Choosing strategy over Tactics

Dr. Ratnik Gandhi, Ahmedabad University

Market games between firms - producing similar goods - are (typically) played with production levels or market prices as firms' strategies.

In this talk, I will first introduce basics of game theory: games, equilibrium and related computational problems. Subsequently, I will talk about equilibria in market delegation games and show how firms benefit by delegating their games.

This talk will not assume any background in Mathematical Economics and will be self contained.

Date : October 28, 2023
A Card Trick - Protocol, Graph model, and extensions

Prof. hhhh kjj Professor Emeritus (Department of Mathematics), Illinois State University

Lorem ipsum dolor sit amet consectetur adipisicing elit. Deleniti mollitia velit voluptate, excepturi sunt quos maxime fugiat iusto quibusdam perferendis dicta cum aspernatur fuga culpa rerum tempore repudiandae porro quas!

Date : September 28, 2034
Property-Driven Fence Insertion using Reorder Bounded Model Checking

Dr. Saurabh Joshi, IITG

Modern processor architectures employ optimizations such as store buffers. Such an optimization, however, may result in program executions that violate Sequential Consistency. In other words, program statements may appear to have been reordered violating the program order. Some of these executions may result in safety property (assertion) violation. Architectures provide fence instructions(memory barriers) that can be inserted to avoid any unwanted reordering. Too many fences may degrade performance drastically whereas too few fences may result in a buggy behaviour. Due to non-determinism in scheduling and reordering, it may be very difficult for even an expert programmer to insert fences in an optimal manner.

Lorem ipsum dolor sit amet consectetur adipisicing elit. Id vitae quaerat sed consectetur impedit iure dolor est illo ipsam aperiam? Asperiores alias laborum enim similique architecto aperiam odit eos quam.

Date : September 18, 2015
Zero Knowledge Proof

Dr. Bireswar Das, IITGn

Lorem ipsum dolor sit amet consectetur adipisicing elit. A ipsum cupiditate veritatis omnis eaque nemo, animi, id illum magni illo repudiandae, qui suscipit repellendus cum porro quo perferendis nulla deserunt.

Date : August 21, 2015
No-where Differentiable Functions

Prof. Samaresh Chatterji, IIIT Delhi