We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
—Computational performance increasingly depends on parallelism, and many systems rely on heterogeneous resources such as GPUs and FPGAs to accelerate computationally intensive ap...
Marcin Bogdanski, Peter R. Lewis, Tobias Becker, X...
We present a novel framework for recognizing repetitive
sequential events performed by human actors with strong
temporal dependencies and potential parallel overlap. Our
solutio...
In this paper, we are interested in the sender's name extraction in fax cover pages through a machine learning scheme. For this purpose, two analysis methods are implemented ...
Recent advances in statistical inference and machine learning close the divide between simulation and classical optimization, thereby enabling more rigorous and robust microarchit...