Filter your results
- 3
- 3
- 3
- 2
- 1
- 3
- 3
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
Similarity Hashing Based on Levenshtein Distances10th IFIP International Conference on Digital Forensics (DF), Jan 2014, Vienna, Austria. pp.133-147, ⟨10.1007/978-3-662-44952-3_10⟩
Conference papers
hal-01393767v1
|
||
|
Using Approximate Matching to Reduce the Volume of Digital Data10th IFIP International Conference on Digital Forensics (DF), Jan 2014, Vienna, Austria. pp.149-163, ⟨10.1007/978-3-662-44952-3_11⟩
Conference papers
hal-01393769v1
|
||
|
Reducing the Time Required for Hashing Operations9th International Conference on Digital Forensics (DF), Jan 2013, Orlando, FL, United States. pp.101-117, ⟨10.1007/978-3-642-41148-9_7⟩
Conference papers
hal-01460624v1
|