Sciweavers

478 search results - page 75 / 96
» Improving probability bounds by optimization over subsets
Sort
View
ICASSP
2009
IEEE
13 years 5 months ago
On the recovery of nonnegative sparse vectors from sparse measurements inspired by expanders
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...
M. Amin Khajehnejad, Babak Hassibi
TEC
2011
134views more  TEC 2011»
13 years 2 months ago
Differential Evolution: A Survey of the State-of-the-Art
—Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms in current use. DE operates through similar computational step...
Swagatam Das, Ponnuthurai Nagaratnam Suganthan
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
13 years 9 months ago
Stabbing Convex Polygons with a Segment or a Polygon
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...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Approximation algorithms and online mechanisms for item pricing
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...
Maria-Florina Balcan, Avrim Blum
ICC
2007
IEEE
115views Communications» more  ICC 2007»
14 years 1 months ago
Cooperation and Routing in Multi-Hop Networks
— 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...
Elzbieta Beres, Raviraj Adve