6105 search results - page 36 / 1221 » A Parallel Algorithm for Bound-Smoothing |
MOC
2000
13 years 8 months ago
2000
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
DATESO
2010
13 years 6 months ago
2010
This paper presents a simple modification of classic Kohonen network (SOM), which allows parallel processing of input data vectors or partitioning the problem in case of insufficie...
ESIAT
2009
IEEE
13 years 6 months ago
2009
IEEE
Comparing with the rapidly increasing acquiring technology for remotely sensed data, the data processing technologies have been following behind, especially in computing speed and ...
PC
2010
13 years 7 months ago
2010
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
SIAMSC
2010
13 years 6 months ago
2010
Abstract. In this article, we present a parallel geometric multigrid algorithm for solving elliptic partial differential equations (PDEs) on octree based conforming finite elemen...