Sciweavers

380 search results - page 38 / 76
» A Categorical Setting for Lower Complexity
Sort
View
CIE
2010
Springer
14 years 10 months ago
Computable Ordered Abelian Groups and Fields
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
Alexander G. Melnikov
CORR
2008
Springer
92views Education» more  CORR 2008»
14 years 9 months ago
Differential Transmit Diversity Based on Quasi-Orthogonal Space-Time Block Code
By using joint modulation and customized constellation set, we show that Quasi-Orthogonal Space-Time Block Code (QO-STBC) can be used to form a new differential space-time modulati...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
15 years 7 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
VTC
2007
IEEE
15 years 4 months ago
Adaptive Conjugate Gradient DFEs for Wideband MIMO Systems Using Galerkin Projections
— Three new adaptive equalization algorithms for wireless systems operating over frequency selective MIMO channels are proposed. The problem of the MIMO DFE design is formulated ...
Vassilis Kekatos, Aris S. Lalos, Kostas Berberidis
QEST
2006
IEEE
15 years 3 months ago
Bound-Preserving Composition for Markov Reward Models
Stochastic orders can be applied to Markov reward models and used to aggregate models, while introducing a bounded error. Aggregation reduces the number of states in a model, miti...
David Daly, Peter Buchholz, William H. Sanders