2412 search results - page 220 / 483 » Which Problems Have Strongly Exponential Complexity |
131
Voted
EUROCRYPT
2007
Springer
15 years 7 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
139
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
155
click to vote
IACR
2011
14 years 3 months ago
2011
We present a radically new approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on weaker assumptions. A central conceptual con...
154
click to vote
TCC
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
165
click to vote
AAAI
2007
15 years 6 months ago
2007
The exponential growth and reliability of Wikipedia have made it a promising data source for intelligent systems. The first challenge of Wikipedia is to make the encyclopedia mac...