Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Performance Evaluation: Ball-Tree and KD-Tree in the Context of MST   Now a days many algorithms are invented or being inventing to find the
solution for Euclidean Minimum Spanning Tree, EMST, problem, as its
applicability is increasing in much wide range of fields containing spatial or
spatio temporal data viz. astronomy which consists of millions of spatial data.
To solve this problem, we are presenting a technique by adopting the dual tree
algorithm for finding efficient EMST and experimented on a variety of real time
and synthetic datasets. This paper presents the observed experimental
observations and the efficiency of the dual tree framework, in the context of
kdtree and ball tree on spatial datasets of different dimensions.

36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
0
The categories of this paper are: hep-ph
10
The categories of this paper are: q-bio
31
The categories of this paper are: ao-sci
7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
24
The categories of this paper are: dg-ga
27
The categories of this paper are: comp-gas
18
The categories of this paper are: econ
16
The categories of this paper are: stat
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat