Sciweavers

4934 search results - page 51 / 987
» complexity 2008
Sort
View
TWC
2008
156views more  TWC 2008»
15 years 2 months ago
Low-Complexity Map Channel Estimation for Mobile MIMO-OFDM Systems
Abstract-- This paper presents a reduced-complexity maximum a posteriori probability (MAP) channel estimator with iterative data detection for orthogonal frequency division multipl...
Jie Gao, Huaping Liu
116
Voted
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
15 years 2 months ago
The Complexity of the A B C Problem
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
TCBB
2010
122views more  TCBB 2010»
15 years 1 months ago
On the Complexity of uSPR Distance
We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel...
Maria Luisa Bonet, Katherine St. John
108
Voted
EOR
2008
69views more  EOR 2008»
15 years 2 months ago
On the complexity of optimization over the standard simplex
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
E. de Klerk, Dick den Hertog, G. Elabwabi
DCG
2008
77views more  DCG 2008»
15 years 2 months ago
Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...
Eran Nevo