In this talk, we introduce the `cafeteria or the banquet hall queuing problem' strongly motivated by speaker's experience of waiting in the TIFR cafeteria queue: Fixed but a large number of users arrive into a queue which provide
Consider the problem: A committee interviews a stream of N candidates for selecting one. It has to accept or reject each candidate immediately after his/her interview.
High-throughput short read DNA sequencers are enabling inexpensive sampling of genomes at high coverage. Assembling such short reads to discover hitherto unsequenced organisms is an important challenge in computational biology.
Markov chain Monte Carlo (MCMC) methods (which include random walk Monte Carlo methods), are a class of algorithms for sampling from probability distributions based on constructing a Markov chain that has the desired distribution
