Abstract-- This paper presents a fast and reliable globalsearch approach to the problem of virtual camera positioning when multiple objects that need to be within the reach of the ...
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field ac...
Bikash Kumar Dey, Sidharth Jaggi, Michael Langberg
Abstract The problem of finding the best-possible lower bound on the distribution of a non-decreasing function of n dependent risks is solved when n = 2 and a lower bound on the co...
In the paper, two evolutionary approaches to the general DNA sequencing problem, assuming both negative and positive errors in the spectrum, are compared. The older of them is base...