450 search results - page 13 / 90 » Estimating Search Tree Size |
CISS
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper, we propose a memory-constrained tree search (MCTS) algorithm for the detection in multiple-input multiple-output (MIMO) systems. The MCTS algorithm offers a wide...
GLOBECOM
2008
IEEE
13 years 9 months ago
2008
IEEE
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...
ICMCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We propose a quad-tree scheme for obtaining sub-pixel estimates of interframe motion in the frequency domain. Our scheme is based on phase correlation and uses motion compensated ...
SWAT
1992
Springer
14 years 29 days ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
BIBE
2009
IEEE
14 years 3 months ago
2009
IEEE
— Protein sequence motifs information is crucial to the analysis of biologically significant regions. The conserved regions have the potential to determine the role of the protei...