Sciweavers

1431 search results - page 243 / 287
» The complexity of random ordered structures
Sort
View
ICASSP
2010
IEEE
14 years 4 months ago
Physical layer algorithm and hardware verification of MIMO relays using cooperative partial detection
Cooperative communication with multi-antenna relays can significantly increase the reliability and speed. However, cooperative MIMO detection would impose considerable complexity o...
Kiarash Amiri, Michael Wu, Melissa Duarte, Joseph ...
JMLR
2010
147views more  JMLR 2010»
14 years 4 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
ICASSP
2011
IEEE
14 years 1 months ago
New radix-based FHT algorithm for computing the discrete Hartley transform
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
Monir Taha Hamood, Said Boussakta
PODS
2008
ACM
109views Database» more  PODS 2008»
15 years 9 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura
CG
2004
Springer
15 years 1 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li