Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Set_intersection_oracle> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Set_intersection_oracle abstract "A set intersection oracle (SIO) is a data structure which represents a collection of sets and can quickly answer queries about whether the set intersection of two given sets is non-empty.The input to the problem is n finite sets. The sum of the sizes of all sets is N (which also means that there are at most N distinct elements). The SIO should quickly answer any query of the form: "Does the set Si intersect the set Sk"?".
- Set_intersection_oracle wikiPageID "45378348".
- Set_intersection_oracle wikiPageLength "3850".
- Set_intersection_oracle wikiPageOutDegree "6".
- Set_intersection_oracle wikiPageRevisionID "679470672".
- Set_intersection_oracle wikiPageWikiLink Category:Data_structures.
- Set_intersection_oracle wikiPageWikiLink Category:Set_theory.
- Set_intersection_oracle wikiPageWikiLink Data_structure.
- Set_intersection_oracle wikiPageWikiLink Distance_oracle.
- Set_intersection_oracle wikiPageWikiLink Hash_table.
- Set_intersection_oracle wikiPageWikiLink Intersection_(set_theory).
- Set_intersection_oracle wikiPageWikiLink Set_intersection.
- Set_intersection_oracle wikiPageWikiLinkText "set intersection oracle".
- Set_intersection_oracle wikiPageWikiLinkText "set intersection oracle#Reduction to approximate distance oracle".
- Set_intersection_oracle hasPhotoCollection Set_intersection_oracle.
- Set_intersection_oracle wikiPageUsesTemplate Template:Reflist.
- Set_intersection_oracle wikiPageUsesTemplate Template:Technical.
- Set_intersection_oracle subject Category:Data_structures.
- Set_intersection_oracle subject Category:Set_theory.
- Set_intersection_oracle hypernym Structure.
- Set_intersection_oracle type Building.
- Set_intersection_oracle comment "A set intersection oracle (SIO) is a data structure which represents a collection of sets and can quickly answer queries about whether the set intersection of two given sets is non-empty.The input to the problem is n finite sets. The sum of the sizes of all sets is N (which also means that there are at most N distinct elements). The SIO should quickly answer any query of the form: "Does the set Si intersect the set Sk"?".
- Set_intersection_oracle label "Set intersection oracle".
- Set_intersection_oracle sameAs m.012vm4j4.
- Set_intersection_oracle wasDerivedFrom Set_intersection_oracle?oldid=679470672.
- Set_intersection_oracle isPrimaryTopicOf Set_intersection_oracle.