7930 search results - page 1392 / 1586 » Greedy in Approximation Algorithms |
128
click to vote
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
133
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
150
click to vote
GLOBECOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—We develop and evaluate a new method for estimating and optimizing various performance metrics for multihop wireless networks, including MANETs. We introduce an approxim...
131
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
We propose a simple and energy efficient distributed Change Detection scheme for sensor networks based on Page’s parametric CUSUM algorithm. The sensor observations are IID ove...
141
Voted
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...