In the (deletion-channel) trace reconstruction problem, there is an unknown n-bit source string x. An algorithm is given access to independent traces of x, where a trace is formed by deleting each bit ...

Researchers have discovered how to extract and use information in an individual image to determine how far objects are from the focus distance, a feat only accomplished by human and animal visual ...

We show that the combination of dynamic programming with partial-order decomposition algorithms enables us to solve sequencing problems in polynomial time for substantially larger classes of ...

Researchers at Universidad Carlos III de Madrid (UC3M) have developed a set of innovative methods and algorithms that improve ...

This paper develops methods to solve for optimal discretionary policies and optimal commitment policies in rational expectations models. These algorithms, which allow the optimization constraints to ...

There’s a way to slash congestion in the Big Apple’s clogged streets, and the name of the game is “carpooling”. If that sounds obvious enough, a team of scientists at MIT just published a study to ...