Sciweavers

218 search results - page 29 / 44
» Convexity-based algorithms for design centering
Sort
View
DCOSS
2006
Springer
13 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
IJNSEC
2007
193views more  IJNSEC 2007»
13 years 7 months ago
Statistical Attack Resilient Data Hiding
In this paper, we propose a discrete cosine transform (DCT) based spread spectrum data-hiding algorithm that is resilient to statistical attacks. Unlike other spread spectrum base...
Palak K. Amin, Ning Liu, Koduvayur P. Subbalakshmi
FUIN
2010
136views more  FUIN 2010»
13 years 5 months ago
Modeling Biology using Generic Reactive Animation
Abstract. Complex biological systems involve incorporated behaviors of numerous processes, mechanisms and objects. However, experimental analysis, by its nature, divides biological...
Yaki Setty, Irun R. Cohen, David Harel
JAMIA
2011
140views more  JAMIA 2011»
12 years 10 months ago
Never too old for anonymity: a statistical standard for demographic data sharing via the HIPAA Privacy Rule
Objective Healthcare organizations must de-identify patient records before sharing data. Many organizations rely on the Safe Harbor Standard of the HIPAAPrivacy Rule, which enumer...
Bradley Malin, Kathleen Benitez, Daniel R. Masys
HPDC
2003
IEEE
14 years 1 months ago
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is...
Francisco Matias Cuenca-Acuna, Christopher Peery, ...