Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1195184> ?p ?o }
Showing triples 1 to 27 of
27
with 100 triples per page.
- Q1195184 subject Q6109049.
- Q1195184 subject Q6467387.
- Q1195184 subject Q7210623.
- Q1195184 abstract "In computer science, a collision or clash is a situation that occurs when two distinct pieces of data have the same hash value, checksum, fingerprint, or cryptographic digest.Collisions are unavoidable whenever members of a very large set (such as all possible person names, or all possible computer files) are mapped to a relatively short bit string. This is merely an instance of the pigeonhole principle.The impact of collisions depends on the application. When hash functions and fingerprints are used to identify similar data, such as homologous DNA sequences or similar audio files, the functions are designed so as to maximize the probability of collision between distinct but similar data. Checksums, on the other hand, are designed to minimize the probability of collisions between similar inputs, without regard for collisions between very different inputs.".
- Q1195184 wikiPageWikiLink Q1068411.
- Q1195184 wikiPageWikiLink Q17104511.
- Q1195184 wikiPageWikiLink Q173106.
- Q1195184 wikiPageWikiLink Q183427.
- Q1195184 wikiPageWikiLink Q188276.
- Q1195184 wikiPageWikiLink Q2070573.
- Q1195184 wikiPageWikiLink Q207440.
- Q1195184 wikiPageWikiLink Q21198.
- Q1195184 wikiPageWikiLink Q218341.
- Q1195184 wikiPageWikiLink Q224180.
- Q1195184 wikiPageWikiLink Q3745713.
- Q1195184 wikiPageWikiLink Q389463.
- Q1195184 wikiPageWikiLink Q42848.
- Q1195184 wikiPageWikiLink Q477202.
- Q1195184 wikiPageWikiLink Q6109049.
- Q1195184 wikiPageWikiLink Q615485.
- Q1195184 wikiPageWikiLink Q6467387.
- Q1195184 wikiPageWikiLink Q682626.
- Q1195184 wikiPageWikiLink Q7210623.
- Q1195184 wikiPageWikiLink Q7430.
- Q1195184 wikiPageWikiLink Q82753.
- Q1195184 comment "In computer science, a collision or clash is a situation that occurs when two distinct pieces of data have the same hash value, checksum, fingerprint, or cryptographic digest.Collisions are unavoidable whenever members of a very large set (such as all possible person names, or all possible computer files) are mapped to a relatively short bit string. This is merely an instance of the pigeonhole principle.The impact of collisions depends on the application.".
- Q1195184 label "Collision (computer science)".