253 search results - page 12 / 51 » Algorithms for the Approximate Common Divisor Problem |
101
click to vote
AAECC
2006
Springer
14 years 11 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
JAT
2010
14 years 9 months ago
2010
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
NIPS
2003
15 years 18 days ago
2003
The maximisation of information transmission over noisy channels is a common, albeit generally computationally difficult problem. We approach the difficulty of computing the mutua...
ICPR
2008
IEEE
16 years 13 days ago
2008
IEEE
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...