Sciweavers

539 search results - page 7 / 108
» Linear complexity of transformed sequences
Sort
View
PRL
2002
69views more  PRL 2002»
13 years 7 months ago
Variant code transformations for linear quadtrees
In this paper, general guidelines and specific algorithms for code transformations between breadth-first (BF) and depth-first (DF) linear quadtrees are proposed. Each algorithm ha...
Pei-Min Chen
EMNLP
2007
13 years 8 months ago
Finding Good Sequential Model Structures using Output Transformations
In Sequential Viterbi Models, such as HMMs, MEMMs, and Linear Chain CRFs, the type of patterns over output sequences that can be learned by the model depend directly on the modelā...
Edward Loper
DSP
2006
13 years 7 months ago
Non-parametric linear time-invariant system identification by discrete wavelet transforms
We describe the use of the discrete wavelet transform (DWT) for non-parametric linear time-invariant system identification. Identification is achieved by using a test excitation t...
Robert Wing Pong Luk, Robert I. Damper
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 1 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDĪ» āˆ’ , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc
JC
2007
96views more  JC 2007»
13 years 7 months ago
Error linear complexity measures for multisequences
Complexity measures for sequences over ļ¬nite ļ¬elds, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
Wilfried Meidl, Harald Niederreiter, Ayineedi Venk...