Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Proximity_problems> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Proximity_problems abstract "Proximity problems is a class of problems in computational geometry which involve estimation of distances between geometric objects.A subset of these problems stated in terms of points only are sometimes referred to as closest point problems, although the term "closest point problem" is also used synonymously to the nearest neighbor search.A common trait for many of these problems is the possibility to establish the Θ(n log n) lower bound on their computational complexity by reduction from the element uniqueness problem basing on an observation that if there is an efficient algorithm to compute some kind of minimal distance for a set of objects, it is trivial to check whether this distance equals to 0.".
- Proximity_problems wikiPageID "11164440".
- Proximity_problems wikiPageRevisionID "527500601".
- Proximity_problems hasPhotoCollection Proximity_problems.
- Proximity_problems subject Category:Geometric_algorithms.
- Proximity_problems type Abstraction100002137.
- Proximity_problems type Act100030358.
- Proximity_problems type Activity100407535.
- Proximity_problems type Algorithm105847438.
- Proximity_problems type Event100029378.
- Proximity_problems type GeometricAlgorithms.
- Proximity_problems type Procedure101023820.
- Proximity_problems type PsychologicalFeature100023100.
- Proximity_problems type Rule105846932.
- Proximity_problems type YagoPermanentlyLocatedEntity.
- Proximity_problems comment "Proximity problems is a class of problems in computational geometry which involve estimation of distances between geometric objects.A subset of these problems stated in terms of points only are sometimes referred to as closest point problems, although the term "closest point problem" is also used synonymously to the nearest neighbor search.A common trait for many of these problems is the possibility to establish the Θ(n log n) lower bound on their computational complexity by reduction from the element uniqueness problem basing on an observation that if there is an efficient algorithm to compute some kind of minimal distance for a set of objects, it is trivial to check whether this distance equals to 0.".
- Proximity_problems label "Proximity problems".
- Proximity_problems sameAs m.02r264b.
- Proximity_problems sameAs Q7252872.
- Proximity_problems sameAs Q7252872.
- Proximity_problems sameAs Proximity_problems.
- Proximity_problems wasDerivedFrom Proximity_problems?oldid=527500601.
- Proximity_problems isPrimaryTopicOf Proximity_problems.