4277 search results - page 119 / 856 » On Multiple Linear Approximations |
TSP
2010
14 years 4 months ago
2010
In this paper, the achievable rates of the so called "multiple-input multiple-output interference channel", exploited by a couple of single antenna primary terminals and...
127
Voted
ADAC
2008
14 years 10 months ago
2008
We consider the problem of multiple fitting of linearly parametrized curves, that arises in many computer vision problems such as road scene analysis. Data extracted from images us...
69
Voted
ICDIM
2008
IEEE
15 years 4 months ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
121
click to vote
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
87
Voted
CIAC
2000
Springer
15 years 1 months ago
2000
Springer
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...