Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
In this article we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory in the case of Gaussian...
David L. Donoho, Martin Vetterli, Ronald A. DeVore...
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...