497 search results - page 4 / 100 » On a Parallel Extended Euclidean Algorithm |
ECCV
2010
Springer
14 years 28 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
SPDP
1993
IEEE
13 years 11 months ago
1993
IEEE
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...
IPPS
2000
IEEE
14 years 3 days ago
2000
IEEE
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
ASIACRYPT
2003
Springer
14 years 28 days ago
2003
Springer
We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than S...
FCS
2006
13 years 9 months ago
2006
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...