<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01981332</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-03T20:51:34+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances</title>
            <author role="aut">
              <persName>
                <forename type="first">Ahmed</forename>
                <surname>Abdelkader</surname>
              </persName>
              <idno type="halauthorid">1498670-0</idno>
              <affiliation ref="#struct-74696"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sunil</forename>
                <surname>Arya</surname>
              </persName>
              <idno type="halauthorid">1434119-0</idno>
              <affiliation ref="#struct-97019"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Guilherme</forename>
                <surname>da Fonseca</surname>
              </persName>
              <email type="md5">2e5b4efe6ce5bfe3b11e970d43acc416</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">guilherme-da-fonseca</idno>
              <idno type="idhal" notation="numeric">172850</idno>
              <idno type="halauthorid" notation="string">1434126-172850</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9807-028X</idno>
              <idno type="IDREF">https://www.idref.fr/234313765</idno>
              <affiliation ref="#struct-422708"/>
              <affiliation ref="#struct-490706"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">David</forename>
                <surname>Mount</surname>
              </persName>
              <idno type="halauthorid">1434127-0</idno>
              <affiliation ref="#struct-74696"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Guilherme</forename>
                <surname>D. da Fonseca</surname>
              </persName>
              <email type="md5">2e5b4efe6ce5bfe3b11e970d43acc416</email>
              <email type="domain">gmail.com</email>
            </editor>
            <funder ref="#projeurop-97501"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-01-15 03:55:03</date>
              <date type="whenModified">2025-03-14 10:22:02</date>
              <date type="whenReleased">2019-01-15 03:55:03</date>
              <date type="whenProduced">2019-01-06</date>
              <ref type="externalLink" target="https://epubs.siam.org/doi/pdf/10.1137/1.9781611975482.23"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="659648">
                <persName>
                  <forename>Guilherme</forename>
                  <surname>D. da Fonseca</surname>
                </persName>
                <email type="md5">2e5b4efe6ce5bfe3b11e970d43acc416</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01981332</idno>
            <idno type="halUri">https://uca.hal.science/hal-01981332</idno>
            <idno type="halBibtex">abdelkader:hal-01981332</idno>
            <idno type="halRefHtml">&lt;i&gt;SODA 2019 - Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms&lt;/i&gt;, Jan 2019, San Diego, United States. pp.355-372, &lt;a target="_blank" href="https://dx.doi.org/10.1137/1.9781611975482.23"&gt;&amp;#x27E8;10.1137/1.9781611975482.23&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">SODA 2019 - Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2019, San Diego, United States. pp.355-372, &amp;#x27E8;10.1137/1.9781611975482.23&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="PRES_CLERMONT">Université de Clermont</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="LIMOS" corresp="PRES_CLERMONT">Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</idno>
            <idno type="stamp" n="CLERMONT-AUVERGNE-INP">Clermont Auvergne INP</idno>
            <idno type="stamp" n="TEST3-HALCNRS">TEST3-HALCNRS</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Ahmed</forename>
                    <surname>Abdelkader</surname>
                  </persName>
                  <idno type="halauthorid">1498670-0</idno>
                  <affiliation ref="#struct-74696"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sunil</forename>
                    <surname>Arya</surname>
                  </persName>
                  <idno type="halauthorid">1434119-0</idno>
                  <affiliation ref="#struct-97019"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Guilherme</forename>
                    <surname>da Fonseca</surname>
                  </persName>
                  <email type="md5">2e5b4efe6ce5bfe3b11e970d43acc416</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">guilherme-da-fonseca</idno>
                  <idno type="idhal" notation="numeric">172850</idno>
                  <idno type="halauthorid" notation="string">1434126-172850</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9807-028X</idno>
                  <idno type="IDREF">https://www.idref.fr/234313765</idno>
                  <affiliation ref="#struct-422708"/>
                  <affiliation ref="#struct-490706"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">David</forename>
                    <surname>Mount</surname>
                  </persName>
                  <idno type="halauthorid">1434127-0</idno>
                  <affiliation ref="#struct-74696"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>SODA 2019 - Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms</title>
                  <date type="start">2019-01-06</date>
                  <settlement>San Diego</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <publisher>Society for Industrial and Applied Mathematics</publisher>
                  <biblScope unit="serie">Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms</biblScope>
                  <biblScope unit="pp">355-372</biblScope>
                  <date type="datePub">2019-01-02</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1137/1.9781611975482.23</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We present a new approach to ε-approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances. We consider two families of distance functions: (a) convex scaling distance functions including the Mahalanobis distance, the Minkowski metric and multiplicative weights, and (b) Bregman divergences including the Kullback-Leibler divergence and the Itakura-Saito distance.As the fastest known data structures rely on the lifting transformation, their application is limited to the Euclidean metric, and alternative approaches for other distance functions are much less efficient. We circumvent the reliance on the lifting transformation by a careful application of convexification, which appears to be relatively new to computational geometry.We are given n points in ℝd, each a site possibly defining its own distance function. Under mild assumptions on the growth rates of these functions, the proposed data structures answer queries in logarithmic time using O(n log(1/ε)/εd/2) space, which nearly matches the best known results for the Euclidean metric.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="department" xml:id="struct-74696" status="VALID">
          <orgName>Department of Computer Science [College Park]</orgName>
          <desc>
            <address>
              <addrLine>A.V. Williams Building College Park, MD 20742</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.cs.umd.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-75866" type="direct"/>
            <relation active="#struct-566144" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-97019" status="VALID">
          <idno type="IdRef">129076511</idno>
          <idno type="ISNI">0000000419371450</idno>
          <idno type="ROR">https://ror.org/00q4vv597</idno>
          <idno type="Wikidata">Q1333303</idno>
          <orgName>Hong Kong University of Science and Technology</orgName>
          <orgName type="acronym">HKUST</orgName>
          <date type="start">1911-01-01</date>
          <desc>
            <address>
              <addrLine>Clear Water Bay Kowloon Hong Kong</addrLine>
              <country key="HK"/>
            </address>
            <ref type="url">http://www.ust.hk/eng/index.htm</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-422708" status="OLD">
          <idno type="IdRef">196200032</idno>
          <idno type="ROR">https://ror.org/01a8ajp46</idno>
          <orgName>Université Clermont Auvergne [2017-2020]</orgName>
          <orgName type="acronym">UCA  [2017-2020]</orgName>
          <date type="start">2017-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>49, bd François-Mitterrand / CS 60032 / 63001 Clermont-Ferrand Cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.uca.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-490706" status="OLD">
          <idno type="IdRef">155645919</idno>
          <idno type="RNSR">200212221E</idno>
          <orgName>Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes</orgName>
          <orgName type="acronym">LIMOS</orgName>
          <date type="start">2017-01-01</date>
          <date type="end">2020-12-31</date>
          <desc>
            <address>
              <addrLine>Campus Universitaire des Cézeaux, 1 rue de la Chebarde, TSA 60125 / CS 60026, 63178 Aubière Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://limos.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR6158" active="#struct-359750" type="direct"/>
            <relation name="UMR6158" active="#struct-422708" type="direct"/>
            <relation name="UMR6158" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-75866" status="VALID">
          <idno type="IdRef">033011729</idno>
          <idno type="ROR">https://ror.org/047s2c258</idno>
          <idno type="Wikidata">Q503415</idno>
          <orgName>University of Maryland [College Park]</orgName>
          <orgName type="acronym">UMD</orgName>
          <desc>
            <address>
              <addrLine>College Park, MD 20742</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.umd.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-566144" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-566144" status="VALID">
          <idno type="ISNI">0000 0001 2169 5073</idno>
          <idno type="ROR">https://ror.org/01r0c1p88</idno>
          <idno type="Wikidata">https://www.wikidata.org/wiki/Q1480532</idno>
          <orgName>University System of Maryland</orgName>
          <desc>
            <address>
              <country key="US"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-359750" status="VALID">
          <idno type="IdRef">028028694</idno>
          <orgName>Ecole Nationale Supérieure des Mines de St Etienne</orgName>
          <orgName type="acronym">ENSM ST-ETIENNE</orgName>
          <date type="start">1816-01-01</date>
          <desc>
            <address>
              <addrLine>158 Cour Fauriel, 42100 Saint-Étienne</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.mines-stetienne.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="europeanProject" xml:id="projeurop-97501" status="VALID">
          <idno type="number">339025</idno>
          <idno type="program">ERC-2013-ADG</idno>
          <idno type="call">ERC-2013-ADG</idno>
          <orgName>GUDHI</orgName>
          <desc>Algorithmic Foundations of Geometry Understanding in Higher Dimensions</desc>
          <date type="start">2014-01-02</date>
          <date type="end">2019-01-31</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>