Sciweavers

948 search results - page 161 / 190
» What can we achieve by arbitrary announcements
Sort
View
BMCBI
2006
198views more  BMCBI 2006»
13 years 7 months ago
Gene selection and classification of microarray data using random forest
Background: Selection of relevant genes for sample classification is a common task in most gene expression studies, where researchers try to identify the smallest possible set of ...
Ramón Díaz-Uriarte, Sara Alvarez de ...
IACR
2011
127views more  IACR 2011»
12 years 7 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
VLDB
2007
ACM
187views Database» more  VLDB 2007»
14 years 7 months ago
Secure Data Outsourcing
The networked and increasingly ubiquitous nature of today's data management services mandates assurances to detect and deter malicious or faulty behavior. This is particularly...
Radu Sion
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 9 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
ASIACRYPT
2011
Springer
12 years 7 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer