Sciweavers

1000 search results - page 122 / 200
» order 2011
Sort
View
CORR
2011
Springer
168views Education» more  CORR 2011»
14 years 12 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
CORR
2011
Springer
204views Education» more  CORR 2011»
14 years 12 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
PE
2011
Springer
274views Optimization» more  PE 2011»
14 years 11 months ago
A generalized method of moments for closed queueing networks
We introduce a new solution technique for closed product-form queueing networks that generalizes the Method of Moments (MoM), a recently proposed exact algorithm that is several o...
Giuliano Casale
CGO
2011
IEEE
14 years 9 months ago
Flow-sensitive pointer analysis for millions of lines of code
—Many program analyses benefit, both in precision and performance, from precise pointer analysis. An important dimension of pointer analysis precision is flow-sensitivity, whic...
Ben Hardekopf, Calvin Lin
CORR
2011
Springer
166views Education» more  CORR 2011»
14 years 9 months ago
A family of fast-decodable MIDO codes from crossed-product algebras over Q
—Multiple Input Double Output (MIDO) asymmetric space-time codes for 4 transmit antennas and 2 receive antennas can be employed in the downlink from base stations to portable dev...
Laura Luzzi, Frédérique E. Oggier