Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5456333> ?p ?o }
Showing triples 1 to 14 of
14
with 100 triples per page.
- Q5456333 subject Q7700464.
- Q5456333 abstract "In computational geometry, the fixed-radius near neighbor problem is a variant of the nearest neighbor search problem. In the fixed-radius near neighbor problem, one is given as input a set of points in d-dimensional Euclidean space and a fixed distance Δ. One must design a data structure that, given a query point q, efficiently reports the points of the data structure that are within distance Δ of q. The problem has long been studied; Bentley (1975) cites a 1966 paper by Levinthal that uses this technique as part of a system for visualizing molecular structures, and it has many other applications.".
- Q5456333 wikiPageWikiLink Q1252145.
- Q5456333 wikiPageWikiLink Q17098085.
- Q5456333 wikiPageWikiLink Q17295.
- Q5456333 wikiPageWikiLink Q207440.
- Q5456333 wikiPageWikiLink Q3115549.
- Q5456333 wikiPageWikiLink Q51379.
- Q5456333 wikiPageWikiLink Q582659.
- Q5456333 wikiPageWikiLink Q608751.
- Q5456333 wikiPageWikiLink Q7700464.
- Q5456333 wikiPageWikiLink Q874709.
- Q5456333 comment "In computational geometry, the fixed-radius near neighbor problem is a variant of the nearest neighbor search problem. In the fixed-radius near neighbor problem, one is given as input a set of points in d-dimensional Euclidean space and a fixed distance Δ. One must design a data structure that, given a query point q, efficiently reports the points of the data structure that are within distance Δ of q.".
- Q5456333 label "Fixed-radius near neighbors".