An algorithm to estimate the vertices of a tetrahedron with uniform random points inside.
Alina-Daniela VîlcuGabriel Eduard VîlcuPublished in: CoRR (2016)
Keyphrases
- cost function
- convex hull
- learning algorithm
- k means
- optimal solution
- dynamic programming
- delaunay triangulation
- computational complexity
- preprocessing
- estimation algorithm
- detection algorithm
- clustering algorithm
- higher dimensional
- expectation maximization
- probabilistic model
- np hard
- similarity measure
- worst case
- segmentation algorithm
- data points
- matching algorithm
- graph structure
- estimation error
- objective function