Sciweavers

2434 search results - page 269 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 5 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
HICSS
2009
IEEE
144views Biometrics» more  HICSS 2009»
15 years 11 months ago
Privacy Preserving Decision Tree Mining from Perturbed Data
Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure mu...
Li Liu, Murat Kantarcioglu, Bhavani M. Thuraisingh...
CHES
2005
Springer
82views Cryptology» more  CHES 2005»
15 years 9 months ago
Masking at Gate Level in the Presence of Glitches
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
Wieland Fischer, Berndt M. Gammel
COLT
1992
Springer
15 years 8 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
HIS
2004
15 years 5 months ago
GAP Test: A Cognitive Evaluation Procedure for Shape Descriptors
With inspiration from psychophysical researches of the human visual system we propose a novel method for performance evaluation of contour based shape recognition algorithms. We u...
Anarta Ghosh, Nicolai Petkov