Results 51 to 60 of about 1,861,121 (138)
Numerical methods for boundary value problems on random domains [PDF]
In this thesis, we consider the numerical solution of elliptic boundary value problems on random domains. The underlying domain is modelled via a random vector field which is given by its mean and its covariance.
Peters, Michael
core +1 more source
Variational inequations and approximation [PDF]
The existence and uniqueness of the solution of a variational inequality is considered, and methods of approximation of the solution are given.
Noor, MA
core +4 more sources
A unified framework for approximating and clustering data [PDF]
Given a set $F$ of $n$ positive functions over a ground set $X$, we consider the problem of computing $x^*$ that minimizes the expression $\sum_{f\in F}f(x)$, over $x\in X$. A typical application is \emph{shape fitting}, where we wish to approximate a set $P$ of $n$ elements (say, points) by a shape $x$ from a (possibly infinite) family $X$ of shapes ...
Feldman, Dan, Langberg, Michael
openaire +3 more sources
On Clustering Bodies: Geometry and Polyhedral Approximation [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Brieden, Peter Gritzmann
openaire +1 more source
Surrogate modeling approximation using a mixture of experts based on EM joint estimation [PDF]
An automatic method to combine several local surrogate models is presented. This method is intended to build accurate and smooth approximation of discontinuous functions that are to be used in structural optimization problems.
Dimitri Bettebghor +9 more
core +1 more source
Approximate distributions of clusters of extremes [PDF]
In a stationary sequence of random variables, high-threshold exceedances may cluster together. Two approximations of such a clusters distribution are established. These justify and generalize sampling schemes for clusters of extremes already known for Markov chains.
openaire +5 more sources
Approximate Inference via Clustering
In recent years, large-scale Bayesian learning draws a great deal of attention. However, in big-data era, the amount of data we face is growing much faster than our ability to deal with it. Fortunately, it is observed that large-scale datasets usually own rich internal structure and is somewhat redundant.
openaire +3 more sources
Approximate Range Queries for Clustering
We study the approximate range searching for three variants of the clustering problem with a set $P$ of $n$ points in $d$-dimensional Euclidean space and axis-parallel rectangular range queries: the $k$-median, $k$-means, and $k$-center range-clustering query problems.
Eunjin Oh 0001, Hee-Kap Ahn
openaire +5 more sources
Accurate thermochemistry from explicitly correlated distinguishable cluster approximation
An explicitly correlated version of the distinguishable-cluster approximation is presented and extensively benchmarked. It is shown that the usual F12-type explicitly correlated approaches are applicable to distinguishable-cluster theory with single and ...
Frederick R. Manby +7 more
core +1 more source
Optimal Time Bounds for Approximate Clustering [PDF]
Clustering is a fundamental problem in unsupervised learning, and has been studied widely both as a problem of learning mixture models and as an optimization problem. In this paper, we study clustering with respect the emph{k-median} objective function, a natural formulation of clustering in which we attempt to minimize the average distance to cluster ...
Ramgopal R. Mettu, C. Greg Plaxton
openaire +4 more sources

