198 search results - page 13 / 40 » Evidence-invariant Sensitivity Bounds |
TCC
2010
Springer
15 years 7 months ago
2010
Springer
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
94
Voted
ICALP
2004
Springer
15 years 4 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
117
Voted
CPAIOR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
116
click to vote
NIPS
2008
15 years 8 days ago
2008
This paper addresses the important tradeoff between privacy and learnability, when designing algorithms for learning from private databases. We focus on privacy-preserving logisti...
AUTOMATICA
2008
14 years 11 months ago
2008
In this paper, a method for the performance assessment of a variable-gain control design for optical storage drives is proposed. The variablegain strategy is used to overcome well...