Sciweavers

1434 search results - page 69 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
EUROCRYPT
2006
Springer
13 years 11 months ago
Our Data, Ourselves: Privacy Via Distributed Noise Generation
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. The purpose of the noise generation is to crea...
Cynthia Dwork, Krishnaram Kenthapadi, Frank McSher...
BMCBI
2007
154views more  BMCBI 2007»
13 years 7 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
ECCV
2010
Springer
13 years 5 months ago
Spatial-Temporal Granularity-Tunable Gradients Partition (STGGP) Descriptors for Human Detection
Abstract. This paper presents a novel descriptor for human detection in video sequence. It is referred to as spatial-temporal granularity -tunable gradients partition (STGGP), whic...
Yazhou Liu, Shiguang Shan, Xilin Chen, Janne Heikk...
ICTAI
2003
IEEE
14 years 29 days ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 5 days ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård