Sciweavers

1024 search results - page 39 / 205
» Density of Critical Factorizations
Sort
View
ICIP
2004
IEEE
16 years 2 months ago
Estimation of attacker's scale and noise variance for qim-dc watermark embedding
Quantization-based watermarking schemes are vulnerable to amplitude scaling. Therefore, the scaling factor needs to be estimated at the decoder side, such that the received (attac...
Reginald L. Lagendijk, Ivo D. Shterev
68
Voted
TSP
2008
89views more  TSP 2008»
15 years 18 days ago
A Geometrical Study of Matching Pursuit Parametrization
This paper studies the effect of discretizing the parametrization of a dictionary in the particular context of Matching Pursuit decompositions of signals. Our approach relies on th...
Laurent Jacques, Christophe De Vleeschouwer
NIPS
2008
15 years 2 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
109
Voted
SSWMC
2004
15 years 2 months ago
Statistical amplitude scale estimation for quantization-based watermarking
Quantization-based watermarking schemes are vulnerable to amplitude scaling. Therefore the scaling factor has to be accounted for either at the encoder, or at the decoder, prior t...
Ivo D. Shterev, Reginald L. Lagendijk, Richard Heu...
94
Voted
SAMOS
2004
Springer
15 years 6 months ago
Scalable Instruction-Level Parallelism.
This paper presents a model for instruction-level distributed computing that allows the implementation of scalable chip multiprocessors. Based on explicit microthreading it serves ...
Chris R. Jesshope