438 search results - page 8 / 88 » The forest hiding problem |
110
click to vote
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper we consider a hypothesis testing approach for detection of hiding in the least significant bit (LSB). This steganalysis problem is a composite hypothesis testing pro...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Extracting useful correlation from a dataset has been extensively studied. In this paper, we deal with the opposite, namely, a problem we call correlation hiding (CH), which is...
ACL
2007
14 years 11 months ago
2007
Efficient decoding has been a fundamental problem in machine translation, especially with an integrated language model which is essential for achieving good translation quality. ...
79
Voted
SODA
1990
ACM
14 years 10 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
82
Voted
IJNSEC
2007
14 years 9 months ago
2007
To hide data in credentials is a key problem in information security. In this paper, a summary of the work on data hiding-capacity is made and several communication channel models...