Sciweavers

418 search results - page 68 / 84
» On the Adders with Minimum Tests
Sort
View
SIAMSC
2008
139views more  SIAMSC 2008»
13 years 7 months ago
Probing the Pareto Frontier for Basis Pursuit Solutions
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximat...
Ewout van den Berg, Michael P. Friedlander
TASLP
2008
104views more  TASLP 2008»
13 years 7 months ago
Tracking of Nonstationary Noise Based on Data-Driven Recursive Noise Power Estimation
This paper considers estimation of the noise spectral variance from speech signals contaminated by highly nonstationary noise sources. The method can accurately track fast changes ...
Jan S. Erkelens, Richard Heusdens
TCOM
2008
124views more  TCOM 2008»
13 years 7 months ago
Reliable adaptive modulation and interference mitigation for mobile radio slow frequency hopping channels
: Due to correlated fading in frequency hopping (FH) wireless communication systems, it is possible to predict the future channel state information (CSI) for one frequency based on...
Ming Lei, Alexandra Duel-Hallen, Hans Hallen
TCS
2008
13 years 7 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
JCB
2007
97views more  JCB 2007»
13 years 7 months ago
Parsing Nucleic Acid Pseudoknotted Secondary Structure: Algorithm and Applications
Accurate prediction of pseudoknotted nucleic acid secondary structure is an important computational challenge. Prediction algorithms based on dynamic programming aim to find a st...
Baharak Rastegari, Anne Condon