Sciweavers

561 search results - page 19 / 113
» Using number fields to compute logarithms in finite fields
Sort
View
MOC
2002
73views more  MOC 2002»
13 years 8 months ago
Evaluation of zeta function of the simplest cubic field at negative odd integers
Abstract. In this paper, we are interested in the evaluation of the zeta function of the simplest cubic field. We first introduce Siegel's formula for values of the zeta funct...
Hyun Kwang Kim, Jung Soo Kim
ICASSP
2008
IEEE
14 years 2 months ago
Sound field decomposition using spherical microphone arrays
Spherical microphone arrays offer a number of attractive properties such as direction-independent acoustic behavior and ability to reconstruct the sound eld in the vicinity of the...
Dmitry N. Zotkin, Ramani Duraiswami, Nail A. Gumer...
ICPR
2002
IEEE
14 years 9 months ago
Face Detection and Synthesis Using Markov Random Field Models
Markov Random Fields (MRFs) are proposed as viable stochastic models for the spatial distribution of gray level intensities for images of human faces. These models are trained usi...
Sarat C. Dass, Anil K. Jain, Xiaoguang Lu
CVPR
2011
IEEE
13 years 4 months ago
Identifying Players in Broadcast Sports Videos using Conditional Random Fields
We are interested in the problem of automatic tracking and identification of players in broadcast sport videos shot with a moving camera from a medium distance. While there are m...
Wei-Lwun Lu, Jo-Anne Ting, Kevin Murphy, Jim Littl...
IJNSEC
2010
324views more  IJNSEC 2010»
13 years 3 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