Sciweavers

489 search results - page 58 / 98
» A Method for Accelerating the HITS Algorithm
Sort
View
IPPS
2003
IEEE
14 years 29 days ago
Phylogenetic Tree Inference on PC Architectures with AxML/PAxML
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
Alexandros Stamatakis, Thomas Ludwig 0002
3DIM
2007
IEEE
14 years 2 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
14 years 1 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
EUROCRYPT
1998
Springer
13 years 12 months ago
How to Improve an Exponentiation Black-Box
Abstract. In this paper we present a method for improving the performance of RSA-type exponentiations. The scheme is based on the observation that replacing the exponent d by d = d...
Gérard D. Cohen, Antoine Lobstein, David Na...
VVS
1996
IEEE
102views Visualization» more  VVS 1996»
13 years 12 months ago
Fast Rendering of Irregular Grids
We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (eve...
Cláudio T. Silva, Joseph S. B. Mitchell, Ar...