Sciweavers

70 search results - page 7 / 14
» Tractability Results in the Block Algebra
Sort
View
CORR
2007
Springer
138views Education» more  CORR 2007»
14 years 10 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
70
Voted
SIAMSC
2008
118views more  SIAMSC 2008»
14 years 10 months ago
Splitting Methods Based on Algebraic Factorization for Fluid-Structure Interaction
We discuss in this paper the numerical approximation of fluid-structure interaction (FSI) problems dealing with strong added-mass effect. We propose new semi-implicit algorithms ba...
Santiago Badia, Annalisa Quaini, Alfio Quarteroni
GLOBECOM
2006
IEEE
15 years 4 months ago
High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras
— For the number of transmit antennas N = 2a the maximum rate (in complex symbols per channel use) of all the Quasi-Orthogonal Designs (QODs) reported in the literature is a 2a...
Sanjay Karmakar, B. Sundar Rajan
CORR
2007
Springer
141views Education» more  CORR 2007»
14 years 10 months ago
A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures
As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in or...
Alfredo Buttari, Julien Langou, Jakub Kurzak, Jack...
109
Voted
CSR
2007
Springer
15 years 4 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen