Related papers: Approximate Distribution of Hitting Probabilities …
Characterizing the risk of operations is a fundamental requirement in robotics, and a crucial ingredient of safe planning. The problem is multifaceted, with multiple definitions arising in the vast recent literature fitting different…
The study of a machine learning problem is in many ways is difficult to separate from the study of the loss function being used. One avenue of inquiry has been to look at these loss functions in terms of their properties as scoring rules…
Soft interfaces can mediate interactions between particles bound to them. The force transmitted through the surface geometry on a particle may be expressed as a closed line integral of the surface stress tensor around that particle. This…
We introduce a simple, efficient and precise polynomial heuristic for a key NP complete problem, minimum vertex cover. Our method is iterative and operates in probability space. Once a stable probability solution is found we find the true…
Let K be the function field of a connected regular scheme S of dimension 1, and let f : X -> Y be a finite cover of projective smooth and geometrically connected curves over K with g(X) greater or equal to 2. Suppose that f can be extended…
Given a compact orientable surface $\Sigma$, let $\Cal S(\Sigma)$ be the set of isotopy classes of essential simple loops on $\Sigma$. We determine a complete set of relations for a function from $\Cal S(\Sigma)$ to $\bold Z$ to be a…
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
We consider the motion of a particle on a surface which is a small perturbation of the standard sphere. One may qualitatively describe the motion by means of a precessing great circle of the sphere. The observation is employed to derive a…
Optimization problems with uncertainty in the constraints occur in many applications. Particularly, probability functions present a natural form to deal with this situation. Nevertheless, in some cases, the resulting probability functions…
The goal of this study is to provide a method for computing the following: Given a network of curves in 3d (satisfying a condition at the intersection points), compute efficiently a smooth surface such that the curves are geodesics on it.…
This paper is concerned with applications of the theory of approximation and interpolation based on compensated convex transforms developed in [K. Zhang, E. Crooks, A. Orlando, Compensated convexity methods for approximations and…
This paper studies the asymptotic convergence of computed dynamic models when the shock is unbounded. Most dynamic economic models lack a closed-form solution. As such, approximate solutions by numerical methods are utilized. Since the…
In this paper, the compact linearization approach originally proposed for binary quadratic programs with assignment constraints is generalized to such programs with arbitrary linear equations and inequalities that have positive coefficients…
We consider estimating a compact set from finite data by approximating the support function of that set via sublinear regression. Support functions uniquely characterize a compact set up to closure of convexification, and are sublinear…
In this work, we study the dynamics of piecewise smooth systems on a codimension-2 transverse intersection of two codimension-1 discontinuity sets. The Filippov convention can be extended to such intersections, but this approach does not…
Estimating equations arise in a wide range of statistical applications, including longitudinal and clustered data analysis, survival analysis, econometrics, and semiparametric inference. In high-dimensional settings, adding…
An investigation of the effect of surface diffusion in random deposition model is made by analytical methods and reasoning. For any given site, the extent to which a particle can diffuse is decided by the morphology in the immediate…
Within classical optics, one may add microscopic "roughness" to a macroscopically flat mirror so that parallel rays of a given angle are reflected at different outgoing angles. Taking the limit (as the roughness becomes increasingly…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
Discrete forms of the mean and directed curvature are constructed on piecewise flat manifolds, providing local curvature approximations for smooth manifolds embedded in both Euclidean and non-Euclidean spaces. The resulting expressions take…