- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Journal of Digital Forensics, Security and Law (JDFSL), 13, 1, S. 10-
- Ereignis
-
Veröffentlichung
- (wo)
-
Augsburg
- (wer)
-
Universität Augsburg
- (wann)
-
2018
- Ereignis
-
Veröffentlichung
- (wo)
-
Ponce Inlet, FL
- (wer)
-
The Association for Digital Forensics, Security and Law
- (wann)
-
2018
- Urheber
- DOI
-
10.15394/jdfsl.2018.1489
- URN
-
urn:nbn:de:bvb:384-opus4-1178162
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:27 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Lillis, David
- Breitinger, Frank
- Scanlon, Mark
- Universität Augsburg
- The Association for Digital Forensics, Security and Law
Entstanden
- 2018
Ähnliche Objekte (12)
Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries
Filter algorithms for approximate string matching
Filter algorithms for approximate string matching
BLOOM: BLoom filter based oblivious outsourced matchings
Bloom filters for molecules
Approximate matching: definition and terminology
Packet forwarding using improved Bloom filters
Bloom Filters: One Size Fits All?
Replay Attack Detection Using Bloom Filters
Hunting the pertinency of hash and bloom filter combinations on GPU for fast pattern matching
Approximate Matching for Evaluating Keyphrase Extraction
Approximate Pattern Matching with Index Structures
Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries
Filter algorithms for approximate string matching
Filter algorithms for approximate string matching
BLOOM: BLoom filter based oblivious outsourced matchings
Bloom filters for molecules
Approximate matching: definition and terminology
Packet forwarding using improved Bloom filters
Bloom Filters: One Size Fits All?
Replay Attack Detection Using Bloom Filters
Hunting the pertinency of hash and bloom filter combinations on GPU for fast pattern matching
Approximate Matching for Evaluating Keyphrase Extraction
Approximate Pattern Matching with Index Structures
Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries
Filter algorithms for approximate string matching
Filter algorithms for approximate string matching
BLOOM: BLoom filter based oblivious outsourced matchings
Bloom filters for molecules
Approximate matching: definition and terminology
Packet forwarding using improved Bloom filters
Bloom Filters: One Size Fits All?
Replay Attack Detection Using Bloom Filters
Hunting the pertinency of hash and bloom filter combinations on GPU for fast pattern matching
Approximate Matching for Evaluating Keyphrase Extraction