We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...
Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different for...
Next generation architectures will require innovative solutions to reduce energy consumption. One of the trends we expect is more extensive utilization of compiler information dir...
Saurabh Chheda, Osman S. Unsal, Israel Koren, C. M...
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...