Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Computing the Approximate Convex Hull in High Dimensions   In this paper, an effective method with time complexity of
$\mathcal{O}(K^{3/2}N^2\log \frac{K}{\epsilon_0})$ is introduced to find an
approximation of the convex hull for $N$ points in dimension $n$, where $K$ is
close to the number of vertices of the approximation. Since the time complexity
is independent of dimension, this method is highly suitable for the data in
high dimensions. Utilizing a greedy approach, the proposed method attempts to
find the best approximate convex hull for a given number of vertices. The
approximate convex hull can be a helpful substitute for the exact convex hull
for on-line processes and applications that have a favorable trade off between
accuracy and parsimony.

29
The categories of this paper are: funct-an
3
The categories of this paper are: physics
25
The categories of this paper are: patt-sol
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
33
The categories of this paper are: plasm-ph
8
The categories of this paper are: hep-ex
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org
16
The categories of this paper are: stat
17
The categories of this paper are: q-fin
7
The categories of this paper are: hep-th
0
The categories of this paper are: hep-ph
30
The categories of this paper are: q-alg
14
The categories of this paper are: math-ph
35
The categories of this paper are: mtrl-th