Sciweavers

2631 search results - page 484 / 527
» A Practical Method for the Sparse Resultant
Sort
View
ICIP
2009
IEEE
13 years 5 months ago
Randomness-in-Structured Ensembles for compressed sensing of images
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
Abdolreza A. Moghadam, Hayder Radha
BMCBI
2011
13 years 2 months ago
Bio: : Phylo - phyloinformatic analysis using Perl
Background: Phyloinformatic analyses involve large amounts of data and metadata of complex structure. Collecting, processing, analyzing, visualizing and summarizing these data and...
Rutger A. Vos, Jason Caravas, Klaas Hartmann, Mark...
TIT
2011
134views more  TIT 2011»
13 years 2 months ago
Estimating Heavy-Tail Exponents Through Max Self-Similarity
: In this paper, a novel approach to the problem of estimating the heavy–tail exponent α > 0 of a distribution is proposed. It is based on the fact that block–maxima of siz...
Stilian Stoev, George Michailidis, Murad S. Taqqu
SIAMMAX
2010
116views more  SIAMMAX 2010»
13 years 2 months ago
Structured Total Maximum Likelihood: An Alternative to Structured Total Least Squares
Abstract. Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total l...
Amir Beck, Yonina C. Eldar
TNN
2010
168views Management» more  TNN 2010»
13 years 2 months ago
On the selection of weight decay parameter for faulty networks
The weight-decay technique is an effective approach to handle overfitting and weight fault. For fault-free networks, without an appropriate value of decay parameter, the trained ne...
Andrew Chi-Sing Leung, Hongjiang Wang, John Sum