343 search results - page 2 / 69 » Analysis of watermarking techniques for graph coloring probl... |
ICMCS
2005
IEEE
13 years 11 months ago
2005
IEEE
Parametric watermarking is effected by modifying the linear predictor coefficients of speech. In this work, the parameter noise is analyzed when watermarked speech is subjected t...
ICIP
1999
IEEE
14 years 7 months ago
1999
IEEE
This work concentrates on the problem of watermarking embedding and optimum detection in color images through the use of spread spectrum techniques, both in space (Direct Sequence...
DATE
1997
IEEE
13 years 9 months ago
1997
IEEE
This paper presents an algorithmic technique based on hybridizing Symbolic Manipulation Techniques based on BDDs with more traditional Explicit solving algorithms. To validate the...
STOC
1994
ACM
13 years 9 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...