Sciweavers

146 search results - page 27 / 30
» How to Make Replicated Data Secure
Sort
View
WPES
2004
ACM
14 years 2 months ago
Private collaborative forecasting and benchmarking
Suppose a number of hospitals in a geographic area want to learn how their own heart-surgery unit is doing compared with the others in terms of mortality rates, subsequent complic...
Mikhail J. Atallah, Marina Bykova, Jiangtao Li, Ke...
SASN
2006
ACM
14 years 2 months ago
RANBAR: RANSAC-based resilient aggregation in sensor networks
We present a novel outlier elimination technique designed for sensor networks. This technique is called RANBAR and it is based on the RANSAC (RANdom SAmple Consensus) paradigm, wh...
Levente Buttyán, Péter Schaffer, Ist...
DRM
2007
Springer
14 years 2 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 11 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
MDM
2010
Springer
188views Communications» more  MDM 2010»
13 years 7 months ago
A Distributed Technique for Dynamic Operator Placement in Wireless Sensor Networks
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...
Georgios Chatzimilioudis, Nikos Mamoulis, Dimitrio...