1554 search results - page 90 / 311 » Parameterized Complexity and Approximation Algorithms |
130
click to vote
TCOM
2010
15 years 1 months ago
2010
—This paper deals with the case of a high speed mobile receiver operating in an orthogonal-frequency-divisionmultiplexing (OFDM) communication system. Assuming the knowledge of d...
144
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
113
click to vote
WSC
2001
15 years 4 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
108
click to vote
IPL
2010
15 years 1 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...