30 search results - page 1 / 6 » The probabilistic analysis of a greedy satisfiability algori... |
RSA
2006
13 years 5 months ago
2006
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
TIT
2010
12 years 12 months ago
2010
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...