Sciweavers

1369 search results - page 64 / 274
» Lattice computations for random numbers
Sort
View
GLOBECOM
2008
IEEE
13 years 9 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu
DSD
2007
IEEE
140views Hardware» more  DSD 2007»
14 years 3 months ago
Pseudo-Random Pattern Generator Design for Column-Matching BIST
This paper discusses possibilities for a choice of a pseudorandom pattern generator that is to be used in combination with the column-matching based built-in self-test design meth...
Petr Fiser
ICC
2007
IEEE
14 years 3 months ago
Opportunistic Power Allocation for Random Beamforming in MISO Broadcast Channels
Abstract— This paper proposes the opportunistic power allocation (OPA) scheme for random beamforming with a limited feedback rate. Without the channel state information, the prop...
Edward W. Jang, Hyukjoon Kwon, John M. Cioffi
ICDAR
2007
IEEE
14 years 3 months ago
Handwritten Word Recognition Using Conditional Random Fields
The paper describes a lexicon driven approach for word recognition on handwritten documents using Conditional Random Fields(CRFs). CRFs are discriminative models and do not make a...
Shravya Shetty, Harish Srinivasan, Sargur N. Sriha...
IWSEC
2007
Springer
14 years 3 months ago
Run-Time Randomization to Mitigate Tampering
The problem of defending software against tampering by a malicious host is not expected to be solved soon. Rather than trying to defend against the first attack, randomization tri...
Bertrand Anckaert, Mariusz H. Jakubowski, Ramarath...