Sciweavers

522 search results - page 75 / 105
» What's a Typical Commit
Sort
View
TIT
1998
69views more  TIT 1998»
13 years 7 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.
PRL
2007
107views more  PRL 2007»
13 years 7 months ago
Robust SS watermarking with improved capacity
Robustness is a key attribute of spread spectrum (SS) watermarking scheme. It is significantly deteriorated if one tries to achieve high embedding rate keeping other parameters u...
Santi P. Maity, Malay K. Kundu, Tirtha S. Das
IEEESP
2010
126views more  IEEESP 2010»
13 years 6 months ago
Privacy-Preserving Sharing of Sensitive Information
The need for controlled sharing of sensitive information occurs in many realistic everyday scenarios, ranging from critical (e.g., national security) to mundane (e.g., social netw...
Salvatore J. Stolfo, Gene Tsudik
IJCCBS
2010
105views more  IJCCBS 2010»
13 years 6 months ago
Software safety: relating software assurance and software integrity
: The overall safety integrity of a safety critical system, comprising both software and hardware, is typically specified quantitatively, e.g., in terms of failure rates. However, ...
Ibrahim Habli, Richard Hawkins, Tim Kelly
INFOCOM
2010
IEEE
13 years 6 months ago
Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
Kyunghan Lee, Yung Yi, Jaeseong Jeong, Hyungsuk Wo...