Separable sublinear functions are used to provide upper bounds on the recourse function of a stochastic program. The resulting problem's objective involves the inf-convolution of convex functions. A dual of this problem is formulated to obtain an implementable procedure to calculate the bound. Function evaluations for the resulting convex program only require a small number of single integratio...

The inefficiency of polynomial-time ( PTIME ) algorithms in the context big data indicates a departure from traditional view on tractability. In recent years, sublinear-time have been regarded as new standard for tractability computing problems. Based prior work complexity classes [1] , this paper focuses designing appropriate reductions specialized particular, series pseudo-sublinear-time are ...

Consider a graph G with an assignment of costs to vertices. Even if and all its subgraphs admit balanced separators sublinear size, may only separator cost after deleting small set Z exceptional We improve the bound on ∣ from O ( log V ) … , for any fixed number iterations logarithm.

We give a proof of the sublinear tracking property for sample paths of random walks on various groups acting on spaces with hyperbolic-like properties. As an application, we prove sublinear tracking in Teichmüller distance for random walks on mapping class groups, and on Cayley graphs of a large class of finitely generated groups.

It is known that linear conic systems are a special case of setvalued sublinear mappings. Hence the latter subsumes the former. In this note we observe that linear conic systems also contain set-valued sublinear mappings as a special case. Consequently, the former also subsumes the latter.

In this paper we study the existence of positive radial solutions for some semilinear elliptic problems of order 2m in an annulus with Dirichlet boundary conditions. We consider a nonlinearity which is either sublinear or the sum of a sublinear and a superlinear term.

In this short note we show that the outer norm of a sublinear mapping F, acting between Banach spaces X and Y and with domF = X, is finite only if F is single-valued. This implies in particular that for a sublinear multivalued mapping the inner and the outer norms cannot be finite simultaneously. AMS 2000 Subject Classification: 49J53, 47H04, 54C60.

We study the parallel computation of dynamic programming. We consider four important dynamic programming problems which have wide application, and that have been studied extensively in sequential computation: (1) the 1D problem, (2) the gap problem, (3) the parenthesis problem, and (4) the RNA problem. The parenthesis problem has fast parallel algorithms; almost no work has been done for parall...

Previous literature on very large scale integration routing and wiring estimation typically assumes a one-to-one correspondence between terminals and ports. In practice, however, each “terminal” consists of a large collection of electrically equivalent ports, a fact that is not accounted for in layout steps such as wiring estimation. In this paper, we address the general problem of minimum-cost...

A recent work (Wang et. al., NIPS 2015) gives the fastest known algorithms for orthogonal tensor decomposition with provable guarantees. Their algorithm is based on computing sketches of the input tensor, which requires reading the entire input. We show in a number of cases one can achieve the same theoretical guarantees in sublinear time, i.e., even without reading most of the input tensor. In...