6
votes
Accepted
Minimize distance between curves
Let's assume you have a set of abscissas $x_i$ and two sets of function values on these grid points $f_i, g_i$ representing the functions $f$ and $g$.
As mentioned in the comments, you'll need a model ...
- 3,042
4
votes
How to store a TB size array in C++ on a cluster
You could try using UPC++, which sets up a globally accessible address space distributed across your nodes.
A more standard approach would be to learn how to use MPI.
- 3,921
2
votes
How to store a TB size array in C++ on a cluster
Really the only way to run simulations on a multi-node cluster is to use MPI. And you don't distribute data because that would mean it would start out in one place. With MPI everything is distributed ...
- 1,305
2
votes
Accepted
Clustering pixel clots
If the number of clusters is known (like here)
You may use Lloyd's clustering [1]
The idea is as follows:
it optimizes a set of cluster centers $p_i$:
...
- 2,305
2
votes
Minimize distance between curves
Here is a simple solution.
Find the curve $(x_m, y_m)$ with the largest domain $x$. In your case it is (x2, y2).
Assign it to be the main curve and shift all other ...
1
vote
Minimize distance between curves
Taking a function as reference $f_r$ the scale-translation transformations for each remaining functions can be handled by minimizing
$$
E(a,b,r) = \sum_{k\ne r}^{m}\sum_{j=1}^n \left(f_k(j)a_k+b_k - ...
- 166
1
vote
Clustering with points lying along different 3D planes
Observe that any data-point $$x_i = \begin{bmatrix} x_{i1}\\x_{i2}\\x_{i3} \end{bmatrix}$$ can be interpreted as the three-vector pointing from the origin to the point itself (position vector).
For ...
- 611
Only top scored, non community-wiki answers of a minimum length are eligible