Sciweavers

5962 search results - page 180 / 1193
» Efficient Clustering for Orders
Sort
View
USENIX
2000
15 years 8 months ago
MOSIX: How Linux Clusters Solve Real-World Problems
As the complexity of software increases, the size of the software tends to increase as well, which incurs longer compilation and build cycles. In this paper, the authors present o...
Steve McClure, Richard Wheeler
ICASSP
2011
IEEE
14 years 10 months ago
Bayesian Compressive Sensing for clustered sparse signals
In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. ...
Lei Yu, Hong Sun, Jean-Pierre Barbot, Gang Zheng
STOC
2010
ACM
195views Algorithms» more  STOC 2010»
15 years 10 months ago
Efficiently Learning Mixtures of Two Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...
CLUSTER
2008
IEEE
15 years 8 months ago
Efficient one-copy MPI shared memory communication in Virtual Machines
Efficient intra-node shared memory communication is important for High Performance Computing (HPC), especially with the emergence of multi-core architectures. As clusters continue ...
Wei Huang, Matthew J. Koop, Dhabaleswar K. Panda
MOBIHOC
2005
ACM
16 years 6 months ago
Inducing spatial clustering in MAC contention for spread spectrum ad hoc networks
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
Xiangying Yang, Gustavo de Veciana