5675 search results - page 152 / 1135 » Exploiting Chaos for Computation |
137
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
Abstract. Two new techniques based on nonparametric estimation of probability densities are introduced which improve on the performance of equivalent robust methods currently emplo...
107
click to vote
DAC
2009
ACM
16 years 5 months ago
2009
ACM
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
130
click to vote
DCC
2005
IEEE
16 years 4 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
146
click to vote
PPPJ
2003
ACM
15 years 9 months ago
2003
ACM
A simple programmable Java platform-independent distributed computation system has been developed to exploit the free resources on computers linked together by a network. It is a ...
157
click to vote
WAIFI
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...