Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Approximate Bregman near neighbors in sublinear time: Beyond the
  triangle inequality   In this paper we present the first provable approximate nearest-neighbor
(ANN) algorithms for Bregman divergences. Our first algorithm processes queries
in O(log^d n) time using O(n log^d n) space and only uses general properties of
the underlying distance function (which includes Bregman divergences as a
special case). The second algorithm processes queries in O(log n) time using
O(n) space and exploits structural constants associated specifically with
Bregman divergences. An interesting feature of our algorithms is that they
extend the ring-tree + quad-tree paradigm for ANN searching beyond Euclidean
distances and metrics of bounded doubling dimension to distances that might not
even be symmetric or satisfy a triangle inequality.

2
The categories of this paper are: math
27
The categories of this paper are: comp-gas
30
The categories of this paper are: q-alg
16
The categories of this paper are: stat
4
The categories of this paper are: cond-mat
24
The categories of this paper are: dg-ga
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
13
The categories of this paper are: quant-ph
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
26
The categories of this paper are: bayes-an
31
The categories of this paper are: ao-sci
14
The categories of this paper are: math-ph
15
The categories of this paper are: nucl-ex
34
The categories of this paper are: chem-ph