Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1384131> ?p ?o }
Showing triples 1 to 27 of
27
with 100 triples per page.
- Q1384131 subject Q6467387.
- Q1384131 subject Q8819520.
- Q1384131 abstract "In computer science, the Rabin–Karp algorithm or Karp–Rabin algorithm is a string searching algorithm created by Richard M. Karp and Michael O. Rabin (1987) that uses hashing to find any one of a set of pattern strings in a text. For text of length n and p patterns of combined length m, its average and best case running time is O(n+m) in space O(p), but its worst-case time is O(nm). In contrast, the Aho–Corasick string matching algorithm has asymptotic worst-time complexity O(n+m) in space O(m).A practical application of the algorithm is detecting plagiarism. Given source material, the algorithm can rapidly search through a paper for instances of sentences from the source material, ignoring details such as case and punctuation. Because of the abundance of the sought strings, single-string searching algorithms are impractical.".
- Q1384131 wikiPageExternalLink rec06.pdf.
- Q1384131 wikiPageWikiLink Q1141518.
- Q1384131 wikiPageWikiLink Q1195184.
- Q1384131 wikiPageWikiLink Q1514741.
- Q1384131 wikiPageWikiLink Q164666.
- Q1384131 wikiPageWikiLink Q183427.
- Q1384131 wikiPageWikiLink Q190087.
- Q1384131 wikiPageWikiLink Q21198.
- Q1384131 wikiPageWikiLink Q2125043.
- Q1384131 wikiPageWikiLink Q269878.
- Q1384131 wikiPageWikiLink Q319400.
- Q1384131 wikiPageWikiLink Q374040.
- Q1384131 wikiPageWikiLink Q402342.
- Q1384131 wikiPageWikiLink Q4228982.
- Q1384131 wikiPageWikiLink Q45285.
- Q1384131 wikiPageWikiLink Q49008.
- Q1384131 wikiPageWikiLink Q49111.
- Q1384131 wikiPageWikiLink Q6467387.
- Q1384131 wikiPageWikiLink Q8815.
- Q1384131 wikiPageWikiLink Q8819520.
- Q1384131 wikiPageWikiLink Q885373.
- Q1384131 wikiPageWikiLink Q895984.
- Q1384131 comment "In computer science, the Rabin–Karp algorithm or Karp–Rabin algorithm is a string searching algorithm created by Richard M. Karp and Michael O. Rabin (1987) that uses hashing to find any one of a set of pattern strings in a text. For text of length n and p patterns of combined length m, its average and best case running time is O(n+m) in space O(p), but its worst-case time is O(nm).".
- Q1384131 label "Rabin–Karp algorithm".