Generalized additive models are an effective regression tool, popular in the statistics literature, that provides an automatic extension of traditional linear models to nonlinear systems. We present a distributed algorithm for fitting generalized additive models, based on the alternating direction method of multipliers (ADMM). In our algorithm the component functions of the model are fit indepe...

We propose a method for solving linear space-time variant blind source separation (BSS) problem with additive noise, x=As+n, on the “pixelby-pixel” basis i.e. assuming that unknown mixing matrix is different for every space or time location. Solution corresponds with the isothermal-To equilibrium of the free energy H =U-ToS contrast function where U represents the input/output energy exchange a...

A new combinatorial algorithm for fitting additive trees to proximity data is described. This algorithm, termed the "generalized triples" or GT method, proceeds by examining all triples of objects x,y,u in relation to the remaining set of objects to be clustered. For a given focal object, say x, the algorithm determines whether y or u is x's nearest neighbor using estimates derived from the dis...

We consider the solution of linear systems of algebraic equations that arise from elliptic nite element problems We study a two level overlapping domain decomposition method that can be viewed as a combination of the additive and multiplicative Schwarz methods This method combines the advantages of the two methods It converges faster than the additive Schwarz algorithm and is more parallelizabl...

The aim of the paper is to present computer software which analyse a geometric design of product and determine which part of product will be done with CNC milling and which part will be done with additive technology. Subsequently it split the CAD model of product on two or more part and save part for CNC milling in format which is used for making CNC code and save part for additive manufacturin...

We apply existing, and develop new, zero-sum game techniques for designing polynomial-time algorithms to compute additive approximate Nash equilibria in bimatrix games. In particular, we give a polynomial-time algorithm that given an arbitrary bimatrix game as an input, outputs either an additive 1 3 -Nash equilibrium or an additive 1 2 -well-supported Nash equilibrium; and we give a polynomial...