G. Golub and C. van Loan. Matrix Computations. John Hopkins University Press, second edition edition, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
High Dimensional Feature Indexing Using Hybrid Trees - Chakrabarti, Mehrotra (1999) (1 citation) (Correct)
....indexed using a multidimensional data structure that works well at lower dimensionalities (e.g. a spatial data structure) A range query in the original space is appropriately mapped to the transformed (lower dimensional) space. Common mapping techniques used are KL transform [13] SVD [14] and Fastmap [12] We can also view ordering techniques (e.g. Z ordering [27] Hilbert Curve [19] pyramid technique [2] as a degenerate case of the general DR technique where the transformed space is 1 dimensional and the data structure used to index the transformed space is a B tree. DR ....
G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, second edition edition, 1989.
Natural Language Processing in Information Retrieval - Grøvlen (1995) (Correct)
.... : 8 3 Discussion 1 INTRODUCTION 1 1 Introduction Information retrieval is a wide, often loosely defined term, but when information retrieval is used to describe a field of research, one could in most cases substitute document for information [8]. A definition along these lines is given by Lancaster [4] Information retrieval is the term conventionally, though somewhat inaccurately, applied to the type of activity discussed in this volume. An information retrieval system does not inform (i.e. change the knowledge of) the user on the ....
C. J. van Rijsbergen. Information Retrieval. Butterworths, London, second edition edition, 1979.
Deriving Incremental Programs - Liu, Teitelbaum (1993) (Correct)
....a parameter. Example. To illustrate the four step derivation approach, we present a simple case of matrix multiplication as an example. Let x be hC; Ri, where C and R are two lists of numbers. The function mtxMul(C; R) treats C as a column vector, R as a row vector, and returns their outer product[15]. The resulting matrix is represented as a list of rows, where each row is a list of numbers. The auxiliary function rowMul(e; R) multiplies an element e with each element in a row R and returns the row of products. The function definitions are: mtxMul(C; R) if null(C) then nil else ....
G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore and London, second edition edition, 1989.
An Ecient Approach to Decompose the - Multidimensional Assignment Problem (Correct)
No context found.
G. Golub and C. van Loan. Matrix Computations. John Hopkins University Press, second edition edition, 1989.
On Scaling Latent Semantic Indexing for Large Peer-To-Peer.. - Tang, Dwarkadas, Xu (2004) (2 citations) (Correct)
No context found.
G. Golub and C. V. Loan. Matrix Computations. The Jason Hopkins University Press, Baltimore, Maryland, second edition edition, 1989.
A look-ahead algorithm for the solution of block Toeplitz.. - Van Barel, Bultheel (1995) (2 citations) (Correct)
No context found.
G.H. Golub and Ch.F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore and London, second edition edition,
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC