Sciweavers

1612 search results - page 44 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
ICDM
2009
IEEE
162views Data Mining» more  ICDM 2009»
15 years 4 months ago
Accurate Estimation of the Degree Distribution of Private Networks
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
Michael Hay, Chao Li, Gerome Miklau, David Jensen
FOCS
2007
IEEE
15 years 4 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
SIGSOFT
2008
ACM
15 years 10 months ago
Deriving input syntactic structure from execution
Program input syntactic structure is essential for a wide range of applications such as test case generation, software debugging and network security. However, such important info...
Zhiqiang Lin, Xiangyu Zhang
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
IJCNN
2007
IEEE
15 years 4 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar