3281 search results - page 388 / 657 » Bases for parametrized iterativity |
182
click to vote
CISS
2010
IEEE
14 years 10 months ago
2010
IEEE
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
209
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
This paper presents a novel method to increase the accuracy
of linear fitting of implicit polynomials. The proposed
method is based on the 3L algorithm philosophy. The novelty
l...
205
click to vote
TSP
2008
15 years 6 months ago
2008
Estimation and tracking of generally nonstationary Markov processes is of paramount importance for applications such as localization and navigation. In this context, ad hoc wireles...
180
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
200
click to vote
SAC
2006
ACM
16 years 20 days ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...