Research
Many discrete algorithms for convex optimization and online learning can be interpreted as a discretization of a continuous-time process. Perhaps the simplest and oldest example is gradient descent, which is the discretization of the ODE…
Homomorphic encryption is an encryption function which permits encrypted data to be computed without decryption. It is considered as a solution for protecting privacy information in present situations such as cloud computing and machine communication.…
In a classical problem in scheduling, one has n unit size jobs with a precedence order and the goal is to find a schedule of those jobs on m identical machines as to minimize the…
The Fujishige-Wolfe heuristic is empirically one of the fastest algorithms for Submodular Function Minimization and is based upon Wolfe’s algorithm to find the nearest point on a polytope to the origin. There was no theoretical…
