Sciweavers

2333 search results - page 126 / 467
» Recursive Computational Depth
Sort
View
SADM
2011
13 years 4 months ago
Random survival forests for high-dimensional data
: Minimal depth is a dimensionless order statistic that measures the predictiveness of a variable in a survival tree. It can be used to select variables in high-dimensional problem...
Hemant Ishwaran, Udaya B. Kogalur, Xi Chen, Andy J...
ASIACRYPT
2005
Springer
14 years 3 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov
ENTCS
2008
124views more  ENTCS 2008»
13 years 9 months ago
Stability for Effective Algebras
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tuc...
EUROCRYPT
2010
Springer
14 years 2 months ago
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tr...
FSTTCS
2006
Springer
14 years 1 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...