10608 search results - page 280 / 2122 » Complexity of O'Hara's Algorithm |
AICCSA
2001
IEEE
15 years 4 months ago
2001
IEEE
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...
98
Voted
GRAPHICSINTERFACE
1998
15 years 1 months ago
1998
In the past, new global illumination algorithms have usually been designed as a single module that was responsible for the simulation of all aspects of illumination in a scene. A ...
75
Voted
JMLR
2011
14 years 7 months ago
2011
This paper presents the CLUSTERING ALGORITHMS’ REFEREE PACKAGE or CARP, an open source GNU GPL-licensed C package for evaluating clustering algorithms. Calibrating performance o...
113
Voted
IJFCS
2006
15 years 17 days ago
2006
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
106
Voted
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
The popularity of zonal based algorithms for block based motion estimation has been recently increasing due to their superior performance in both terms of reduced complexity and s...