Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
The coupled problem with Stokes flow in one subdomain and a Darcy flow model in a second subdomain is studied in this paper. Both flow problems are treated as first-order syste...
Despite parallels between the structure of poetry composition tasks and design tasks, there appears to be no previous research exploring the consequences of these correspondences ...
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...