12519 search results - page 211 / 2504 » Approximation Problems Categories |
145
click to vote
JAT
2007
15 years 6 months ago
2007
We prove sharp bounds for the expectation of the supremum of the Gaussian process indexed by the intersection of Bn p with ρBn q for 1 ≤ p, q ≤ ∞ and ρ > 0, and by the ...
192
click to vote
COLOGNETWENTE
2010
15 years 5 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
198
click to vote
SECON
2010
IEEE
15 years 4 months ago
2010
IEEE
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
160
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
157
click to vote
ICASSP
2008
IEEE
16 years 29 days ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...