We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled beh...
The problem of online sampling of data, can be seen as a generalization of the classical secretary problem. The goal is to maximize the probability of picking the k highest scorin...
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...
An ongoing research topic is to build suitable visualization architectures for anthropomorphic conversational user interfaces which will run on different devices like laptops, PDA...
One of the simplest sensor network models has one single underlying Gaussian source of interest, observed by many sensors, subject to independent Gaussian observation noise. The se...