536 search results - page 65 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
CPM
2000
Springer
14 years 2 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
CORR
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper, the problem of estimating the damping factor and frequency parameters from multiple cisoids in noise is addressed. We rst propose a data matrix which generalizes th...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
The peak-to-mean envelope power ratio (PMEPR) of a code employed in orthogonal frequencydivision multiplexing (OFDM) systems can be reduced by permuting its coordinates and by rot...