Garbage collection tables for finding pointers on the stack can be represented in 20-25% of the space previously reported. Live pointer information is often the same at many call ...
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...
Harmonic analysis and diffusion on discrete data has been shown to lead to state-of-theart algorithms for machine learning tasks, especially in the context of semi-supervised and ...
Arthur D. Szlam, Mauro Maggioni, Ronald R. Coifman
We present a new approach to pricing American-style derivatives that is applicable to any Markovian setting (i.e., not limited to geometric Brownian motion) for which European cal...
Scott B. Laprise, Michael C. Fu, Steven I. Marcus,...