Sciweavers

20066 search results - page 395 / 4014
» T Spaces
Sort
View
CGF
2007
82views more  CGF 2007»
15 years 7 months ago
Unpopping: Solving the Image-Space Blend Problem for Smooth Discrete LOD Transitions
This paper presents a new, simple and practical algorithm to avoid artifacts when switching between discrete levels of detail (LOD) by smoothly blending LOD representations in ima...
Markus Giegl, Michael Wimmer
IJAIT
2006
103views more  IJAIT 2006»
15 years 7 months ago
Rendering Aesthetic Impressions of Text in Color Space
and renders an abstract color grid artwork reminiscent of early twentieth century abstract expressionism. Following Dewey's psychological interpretation of "aesthetic&quo...
Hugo Liu, Pattie Maes
IJON
2006
53views more  IJON 2006»
15 years 7 months ago
Sub-intrapersonal space analysis for face recognition
Bayesian subspace analysis has been successfully applied in face recognition. However, it suffers from its operating on a whole face difference and using one global linear subspac...
Xiaoyang Tan, Jun Liu, Songcan Chen
CORR
2007
Springer
84views Education» more  CORR 2007»
15 years 7 months ago
MMSE Optimal Algebraic Space-Time Codes
—Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs...
G. Susinder Rajan, B. Sundar Rajan
CORR
2007
Springer
138views Education» more  CORR 2007»
15 years 7 months ago
Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity
— ”Extended Clifford algebras” are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two speci...
G. Susinder Rajan, B. Sundar Rajan