Sciweavers

3941 search results - page 226 / 789
» Computational Efficiency of Batching Methods
Sort
View
TC
2008
15 years 4 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
CVPR
2008
IEEE
16 years 6 months ago
Statistical analysis on Stiefel and Grassmann manifolds with applications in computer vision
Many applications in computer vision and pattern recognition involve drawing inferences on certain manifoldvalued parameters. In order to develop accurate inference algorithms on ...
Pavan K. Turaga, Ashok Veeraraghavan, Rama Chellap...
IJNSEC
2010
324views more  IJNSEC 2010»
14 years 11 months ago
Computing the Modular Inverse of a Polynomial Function over GF(2P) Using Bit Wise Operation
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
Rajaram Ramasamy, Amutha Prabakar Muniyandi
VLSID
2004
IEEE
147views VLSI» more  VLSID 2004»
16 years 4 months ago
Computing Silent Gate Models for Noise Analysis from Slew and Delay Tables
Abstract--In this paper, we present a new approach to calculate the steady state resistance values for CMOS library gates. These resistances are defined as simple equivalent models...
Shabbir H. Batterywala, Narendra V. Shenoy
PAMI
2002
150views more  PAMI 2002»
15 years 3 months ago
Object Tracking with Bayesian Estimation of Dynamic Layer Representations
Decomposing video frames into coherent two-dimensional motion layers is a powerful method for representing videos. Such a representation provides an intermediate description that e...
Hai Tao, Harpreet S. Sawhney, Rakesh Kumar