Sciweavers

237 search results - page 21 / 48
» Algorithms for Exponentiation in Finite Fields
Sort
View
AAECC
1999
Springer
78views Algorithms» more  AAECC 1999»
13 years 7 months ago
Properties of Finite Response Input Sequences of Recursive Convolutional Codes
Abstract. A recursive convolutional encoder can be regarded as an innite impulse response system over the Galois Field of order 2. First, in this paper, we introduce nite response ...
Didier Le Ruyet, Hong Sun, Han Vu Thien
ICML
2005
IEEE
14 years 8 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...
ICML
2004
IEEE
14 years 8 months ago
Training conditional random fields via gradient tree boosting
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
Thomas G. Dietterich, Adam Ashenfelter, Yaroslav B...
MICCAI
2003
Springer
14 years 8 months ago
Relative Performance of Geometric Search Algorithms for Interpolating Unstructured Mesh Data
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...
Mahdieh Khoshniat, Gordan R. Stuhne, David A. Stei...
AICOM
2004
92views more  AICOM 2004»
13 years 7 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu