2938 search results - page 136 / 588 » On obfuscating point functions |
139
click to vote
ANTS
1998
Springer
15 years 10 months ago
1998
Springer
We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O(...
156
click to vote
SPAA
1992
ACM
15 years 10 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
179
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
167
click to vote
ISIM
2007
15 years 7 months ago
2007
Abstract. This paper proposes a modified, genomial, version of function - architecture co-design rnethod so that wider cvaluation of architecturcs from both functional arrd structu...
172
click to vote
NIPS
2001
15 years 7 months ago
2001
We propose a novel clustering method that is an extension of ideas inherent to scale-space clustering and support-vector clustering. Like the latter, it associates every data poin...