7930 search results - page 1181 / 1586 » Greedy in Approximation Algorithms |
206
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
160
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
182
click to vote
IJWIN
2006
15 years 6 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
183
click to vote
JCO
2008
15 years 6 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
203
click to vote
CVIU
2007
15 years 6 months ago
2007
A Bayesian framework is proposed for stereo vision where solutions to both the model parameters and the disparity map are posed in terms of predictions of latent variables, given ...