Sciweavers

2542 search results - page 367 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 10 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
JACM
2006
98views more  JACM 2006»
13 years 10 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
JSAC
2006
89views more  JSAC 2006»
13 years 10 months ago
Robust multiuser detection for multicarrier CDMA systems
Abstract--Multiuser detection (MUD) for code-division multiple-access (CDMA) systems usually relies on some a priori channel estimates, which are obtained either blindly or by usin...
Rensheng Wang, Hongbin Li, Tao Li
MONET
2006
107views more  MONET 2006»
13 years 10 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao
PE
2006
Springer
107views Optimization» more  PE 2006»
13 years 10 months ago
Efficient steady-state analysis of second-order fluid stochastic Petri nets
This paper presents an efficient solution technique for the steady-state analysis of the second-order Stochastic Fluid Model underlying a second-order Fluid Stochastic Petri Net (...
Marco Gribaudo, Rossano Gaeta