An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jacm/AryaMNSW98
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jacm/AryaMNSW98
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Angela_Y._Wu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/David_M._Mount
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nathan_S._Netanyahu
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ruth_Silverman
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sunil_Arya
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F293347.293348
>
foaf:
homepage
<
https://doi.org/10.1145/293347.293348
>
dc:
identifier
DBLP journals/jacm/AryaMNSW98
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F293347.293348
(xsd:string)
dcterms:
issued
1998
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jacm
>
rdfs:
label
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Angela_Y._Wu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/David_M._Mount
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nathan_S._Netanyahu
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ruth_Silverman
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sunil_Arya
>
swrc:
number
6
(xsd:string)
swrc:
pages
891-923
(xsd:string)
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/edbt/WeberB00
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/journals/tods/HjaltasonS99
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/journals/vldb/ZezulaSAR98
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jacm/AryaMNSW98/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jacm/AryaMNSW98
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jacm/jacm45.html#AryaMNSW98
>
rdfs:
seeAlso
<
https://doi.org/10.1145/293347.293348
>
dc:
subject
approximation algorithms, box-decomposition trees, closet-point queries, nearest neighbor searching, post-office problem, priority search
(xsd:string)
dc:
title
An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
45
(xsd:string)