Sciweavers

2570 search results - page 116 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
87
Voted
CHINAF
2008
69views more  CHINAF 2008»
14 years 10 months ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang
81
Voted
CG
2005
Springer
14 years 10 months ago
Computing geodesics on triangular meshes
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
Dimas Martínez Morera, Luiz Velho, Paulo Ce...
72
Voted
MICCAI
2008
Springer
15 years 11 months ago
New Algorithms to Map Asymmetries of 3D Surfaces
Abstract. In this paper, we propose a set of new generic automated processing tools to characterise the local asymmetries of anatomical structures (represented by surfaces) at an i...
Benoît Combès, Sylvain Prima
69
Voted
APPML
2010
112views more  APPML 2010»
14 years 10 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala
DAC
2009
ACM
15 years 2 months ago
GPU-based parallelization for fast circuit optimization
The progress of GPU (Graphics Processing Unit) technology opens a new avenue for boosting computing power. This work is an attempt to exploit GPU for accelerating VLSI circuit opt...
Yifang Liu, Jiang Hu