3044 search results - page 140 / 609 » Linear logical approximations |
ICDIM
2008
IEEE
14 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....
MFCS
2001
Springer
14 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...
CIAC
2000
Springer
14 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 ...
PPSC
1993
13 years 11 months ago
1993
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...
APPML
2006
13 years 10 months ago
2006
We introduce new boundary conditions for Large Eddy Simulation. These boundary conditions are based on an approximate deconvolution approach. They are computationally efficient an...