713 search results - page 38 / 143 » Saving Space by Algebraization |
CORR
2006
Springer
15 years 14 days ago
2006
Springer
A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximumlikelihood decoding metric can be written as a sum of g terms such that each ...
97
Voted
CORR
2007
Springer
15 years 13 days ago
2007
Springer
It is well known that Space-Time Block Codes (STBCs) obtained from Orthogonal Designs (ODs) are singlesymbol-decodable (SSD) and from Quasi-Orthogonal Designs (QODs) are double-sy...
IJCV
2007
15 years 11 days ago
2007
Abstract. We address the problem of finding the correspondences of two point sets in 3D undergoing a rigid transformation. Using these correspondences the motion between the two s...
SAC
2002
ACM
15 years 3 days ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
COMPGEOM
1994
ACM
15 years 4 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...