478 search results - page 75 / 96 » Improving probability bounds by optimization over subsets |
84
Voted
ICASSP
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper studies compressed sensing for the recovery of non-negative sparse vectors from a smaller number of measurements than the ambient dimension of the unknown vector. We fo...
TEC
2011
14 years 4 months ago
2011
—Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms in current use. DE operates through similar computational step...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
78
Voted
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— We study the cross-layer problem of combining routing and cooperative diversity in multi-hop, bandwidthconstrained networks with dedicated multiple access. Previous work in coo...