Towards a provably resilient scheme for graph-based watermarking (Q2864290)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Towards a provably resilient scheme for graph-based watermarking |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards a provably resilient scheme for graph-based watermarking |
scientific article |
Statements
Towards a Provably Resilient Scheme for Graph-Based Watermarking (English)
0 references
6 December 2013
0 references
algorithms
0 references
reducible permutation graphs
0 references
graph-based watermarking
0 references
software security
0 references
0.8866813778877258
0 references
0.8835217356681824
0 references
0.8520504236221313
0 references
0.8494049906730652
0 references
