We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Presentation of the exponential families, of the mixtures of such distributions and how to learn it. We then present algorithms to simplify mixture model, using Kullback-Leibler di...
— Hypervolume based multiobjective evolutionary algorithms (MOEA) nowadays seem to be the first choice when handling multiobjective optimization problems with many, i.e., at lea...
This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an a...