438 search results - page 10 / 88 » The forest hiding problem |
134
click to vote
CRYPTO
1994
Springer
15 years 8 months ago
1994
Springer
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
152
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
123
click to vote
DEXA
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of data-stream classification, introducing a stream-classification algorithm, Dynamic Streaming Random Forests, that is able to handle evolving data streams...
191
click to vote
TIFS
2008
15 years 3 months ago
2008
Abstract-- It has recently been discovered that using pseudorandom sequences as carriers in spread-spectrum techniques for data-hiding is not at all a sufficient condition for ensu...
67
Voted
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we consider the problem of optimal self-embedding Lapalcian data hiding for the state-dependent channels. In particular, we propose to decompose the Laplacian data ...