104 search results - page 8 / 21 » A Greedy Algorithm Estimating the Height of Random Trees |
ICASSP
2011
IEEE
13 years 9 days ago
2011
IEEE
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
AAAI
1996
13 years 10 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...