2434 search results - page 104 / 487 » Algorithmic Randomness of Closed Sets |
133
Voted
CRYPTO
2011
Springer
14 years 3 months ago
2011
Springer
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
228
click to vote
TIT
2008
15 years 3 months ago
2008
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
157
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
263
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Markov random field (MRF, CRF) models are popular in
computer vision. However, in order to be computationally
tractable they are limited to incorporate only local interactions
a...
140
click to vote
ACCV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...