Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Best_bin_first> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Best_bin_first abstract "Best bin first is a search algorithm that is designed to efficiently find an approximate solution to the nearest neighbor search problem in very-high-dimensional spaces. The algorithm is based on a variant of the kd-tree search algorithm which makes indexing higher-dimensional spaces possible. Best bin first is an approximate algorithm which returns the nearest neighbor for a large fraction of queries and a very close neighbor otherwise.".
- Best_bin_first wikiPageID "15585323".
- Best_bin_first wikiPageRevisionID "603813241".
- Best_bin_first hasPhotoCollection Best_bin_first.
- Best_bin_first subject Category:Search_algorithms.
- Best_bin_first type Abstraction100002137.
- Best_bin_first type Act100030358.
- Best_bin_first type Activity100407535.
- Best_bin_first type Algorithm105847438.
- Best_bin_first type Event100029378.
- Best_bin_first type Procedure101023820.
- Best_bin_first type PsychologicalFeature100023100.
- Best_bin_first type Rule105846932.
- Best_bin_first type SearchAlgorithms.
- Best_bin_first type YagoPermanentlyLocatedEntity.
- Best_bin_first comment "Best bin first is a search algorithm that is designed to efficiently find an approximate solution to the nearest neighbor search problem in very-high-dimensional spaces. The algorithm is based on a variant of the kd-tree search algorithm which makes indexing higher-dimensional spaces possible. Best bin first is an approximate algorithm which returns the nearest neighbor for a large fraction of queries and a very close neighbor otherwise.".
- Best_bin_first label "Best bin first".
- Best_bin_first sameAs m.03mgkyj.
- Best_bin_first sameAs Q4896845.
- Best_bin_first sameAs Q4896845.
- Best_bin_first sameAs Best_bin_first.
- Best_bin_first wasDerivedFrom Best_bin_first?oldid=603813241.
- Best_bin_first isPrimaryTopicOf Best_bin_first.