Sciweavers

4335 search results - page 297 / 867
» Privatizing Constraint Optimization
Sort
View
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 6 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
EUROCRYPT
2008
Springer
15 years 6 months ago
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
Consider an abstract storage device (G) that can hold a single element x from a fixed, publicly known finite group G. Storage is private in the sense that an adversary does not hav...
Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles ...
NIPS
2008
15 years 6 months ago
Privacy-preserving logistic regression
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
Kamalika Chaudhuri, Claire Monteleoni
150
Voted
COMCOM
2008
91views more  COMCOM 2008»
15 years 4 months ago
A WEP post-processing algorithm for a Robust 802.11 WLAN implementation
Wired Equivalent Privacy (WEP) protocol used within the IEEE 802.11 standard has "major security flaws" thus wireless local area networks (WLANs) using the protocol are ...
Taskin Koçak, Mohit Jagetia
INFSOF
2006
66views more  INFSOF 2006»
15 years 4 months ago
Scenario-based multitasking for real-time object-oriented models
Contemporary embedded systems quite often employ extremely complicated software consisting of a number of interrelated components, and this has made object-oriented design methodo...
Saehwa Kim, Jiyong Park, Seongsoo Hong