Sciweavers

978 search results - page 32 / 196
» Knowledge, Probability, and Adversaries
Sort
View
ACNS
2007
Springer
87views Cryptology» more  ACNS 2007»
14 years 11 months ago
Privacy-Preserving Set Union
Recently there has been a significant amount of work on privacy-preserving set operations, including: set intersection [14, 6, 21, 9], testing set disjointness [17], multi-set ope...
Keith B. Frikken
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
15 years 2 months ago
Aggregation of Imprecise and Uncertain Information for Knowledge Discovery in Databases
We consider the problem of aggregation for uncertain and imprecise data. For such data, we define aggregation operators and use them to provide information on properties and patte...
Sally I. McClean, Bryan W. Scotney, Mary Shapcott
CORR
2010
Springer
99views Education» more  CORR 2010»
14 years 9 months ago
Security in Distributed Storage Systems by Communicating a Logarithmic Number of Bits
Abstract--We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that a...
Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tr...
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
13 years 9 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák
FSEN
2009
Springer
15 years 4 months ago
The Complexity of Reachability in Randomized Sabotage Games
Abstract. We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over...
Dominik Klein, Frank G. Radmacher, Wolfgang Thomas