Sciweavers

94 search results - page 9 / 19
» Partitions and Clifford algebras
Sort
View
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 5 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan
ICC
2008
IEEE
139views Communications» more  ICC 2008»
14 years 2 months ago
OFDM Based Distributed Space Time Coding for Asynchronous Relay Networks
— Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to comb...
G. Susinder Rajan, B. Sundar Rajan
CORR
2007
Springer
154views Education» more  CORR 2007»
13 years 7 months ago
Distributed Space-Time Codes for Cooperative Networks with Partial CSI
— Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized ...
G. Susinder Rajan, B. Sundar Rajan
CAGD
2004
141views more  CAGD 2004»
13 years 7 months ago
Almost rotation-minimizing rational parametrization of canal surfaces
Almost rotation minimizing parametrization of the canal surface is given. The basic building block of our approach is the curve approximation scheme that enables us to construct a...
Hyeong In Choi, Song-Hwa Kwon, Nam-Sook Wee
PE
2011
Springer
167views Optimization» more  PE 2011»
13 years 2 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...