2020 search results - page 404 / 404 » Speeding up Slicing |
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
WWW
2003
ACM
14 years 6 months ago
2003
ACM
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
PODC
2009
ACM
14 years 5 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
SC
2004
ACM
13 years 10 months ago
2004
ACM
This paper is structured as follows. Section 2 gives an architectural description of BlueGene/L. Section 3 analyzes the issue of “computational noise” – the effect that the o...
FIMH
2003
Springer
13 years 10 months ago
2003
Springer
Keywords Levelset methods were introduced in medical images segmentation by Malladi et al in 1995. In this paper, we propose several improvements of the original method to speed u...