The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
We study the best known general inner bound[1] and outer bound[2] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bou...
An m-sample semiparametric model in which the ratio of m - 1 probability density functions with respect to the mth is of a known parametric form without reference to any parametri...
Trading decisions in financial markets can be supported by the use of online algorithms. We evaluate the empirical performance of a threat-based online algorithm and compare it to...
It is known that many subspace algorithms give biased estimates for closed-loop data due to the existence of feedback. In this paper we present a new subspace identification metho...