Sciweavers

438 search results - page 39 / 88
» The forest hiding problem
Sort
View
MMSEC
2005
ACM
131views Multimedia» more  MMSEC 2005»
15 years 5 months ago
Capacity of steganographic channels
—This work investigates a central problem in steganography, that is: How much data can safely be hidden without being detected? To answer this question a formal definition of st...
Jeremiah J. Harmsen, William A. Pearlman
ICMCS
2000
IEEE
86views Multimedia» more  ICMCS 2000»
15 years 4 months ago
Water-Filling for Watermarking?
In this paper we address the question: Is water-filling appropriate for watermarking? The water-filling paradigm is a traditional solution to the capacity maximization of parall...
Deepa Kundur
AAAI
1996
15 years 1 months ago
Building Steady-State Simulators via Hierarchical Feedback Decomposition
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
Nicolas F. Rouquette
ISI
2006
Springer
14 years 11 months ago
Inferring Privacy Information from Social Networks
Since privacy information can be inferred via social relations, the privacy confidentiality problem becomes increasingly challenging as online social network services are more popu...
Jianming He, Wesley W. Chu, Zhenyu Liu
RECOMB
2007
Springer
16 years 4 days ago
QNet: A Tool for Querying Protein Interaction Networks
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
Banu Dost, Tomer Shlomi, Nitin Gupta 0002, Eytan R...