Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Interpolation_search> ?p ?o. }
Showing items 1 to 29 of
29
with 100 items per page.
- Interpolation_search abstract "Interpolation search (sometimes referred to as extrapolation search) is an algorithm for searching for a given key value in an indexed array that has been ordered by the values of the key. It parallels how humans search through a telephone book for a particular name, the key value by which the book's entries are ordered. In each search step it calculates where in the remaining search space the sought item might be, based on the key values at the bounds of the search space and the value of the sought key, usually via a linear interpolation. The key value actually found at this estimated position is then compared to the key value being sought. If it is not equal, then depending on the comparison, the remaining search space is reduced to the part before or after the estimated position. This method will only work if calculations on the size of differences between key values are sensible.By comparison, the binary search always chooses the middle of the remaining search space, discarding one half or the other, again depending on the comparison between the key value found at the estimated position and the key value sought. The remaining search space is reduced to the part before or after the estimated position. The linear search uses equality only as it compares elements one-by-one from the start, ignoring any sorting.On average the interpolation search makes about log(log(n)) comparisons (if the elements are uniformly distributed), where n is the number of elements to be searched. In the worst case (for instance where the numerical values of the keys increase exponentially) it can make up to O(n) comparisons.In interpolation-sequential search, interpolation is used to find an item near the one being searched for, then linear search is used to find the exact item.".
- Interpolation_search wikiPageExternalLink p550-perl.pdf.
- Interpolation_search wikiPageExternalLink 322.srch.p.html.
- Interpolation_search wikiPageExternalLink interpolationSearch.html.
- Interpolation_search wikiPageID "69895".
- Interpolation_search wikiPageRevisionID "594272257".
- Interpolation_search hasPhotoCollection Interpolation_search.
- Interpolation_search subject Category:Search_algorithms.
- Interpolation_search type Abstraction100002137.
- Interpolation_search type Act100030358.
- Interpolation_search type Activity100407535.
- Interpolation_search type Algorithm105847438.
- Interpolation_search type Event100029378.
- Interpolation_search type Procedure101023820.
- Interpolation_search type PsychologicalFeature100023100.
- Interpolation_search type Rule105846932.
- Interpolation_search type SearchAlgorithms.
- Interpolation_search type YagoPermanentlyLocatedEntity.
- Interpolation_search comment "Interpolation search (sometimes referred to as extrapolation search) is an algorithm for searching for a given key value in an indexed array that has been ordered by the values of the key. It parallels how humans search through a telephone book for a particular name, the key value by which the book's entries are ordered.".
- Interpolation_search label "Interpolation search".
- Interpolation_search label "Interpolationssuche".
- Interpolation_search label "Интерполирующий поиск".
- Interpolation_search sameAs Interpolationssuche.
- Interpolation_search sameAs m.0j5gt.
- Interpolation_search sameAs Q1147856.
- Interpolation_search sameAs Q1147856.
- Interpolation_search sameAs Interpolation_search.
- Interpolation_search wasDerivedFrom Interpolation_search?oldid=594272257.
- Interpolation_search isPrimaryTopicOf Interpolation_search.