Sciweavers

3049 search results - page 487 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICASSP
2011
IEEE
13 years 20 days ago
Robust adaptive beamforming based on jointly estimating covariance matrix and steering vector
In this paper, a new adaptive beamforming algorithm with joint robustness against covariance matrix uncertainty as well as steering vector mismatch is proposed. First, the theoret...
Yujie Gu, Amir Leshem
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
12 years 8 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...
INFOCOM
2012
IEEE
11 years 11 months ago
Sparse recovery with graph constraints: Fundamental limits and measurement construction
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
Meng Wang, Weiyu Xu, Enrique Mallada, Ao Tang
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
11 years 11 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
IPPS
2009
IEEE
14 years 3 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...