Efficient dot product over word-size finite fields
We want to achieve efficiency for the exact computation of the dot product of two vectors over word-size finite fields.
12 results shown from 48 candidates · 541 indexed matches
We want to achieve efficiency for the exact computation of the dot product of two vectors over word-size finite fields.
This paper compares the tasks of part-of-speech (POS) tagging and word-sense-tagging or disambiguation (WSD), and argues that the tasks are
This paper is concerned with the problem of establishing an index based on word matching. It is assumed that the
One often wishes to quickly add a few overlined characters such as anti-B0 or anti-neutrino to a Microsoft Word document.
This paper presents a model-based, unsupervised algorithm for recovering word boundaries in a natural-language text from which they have been
In this paper Schapire and Singer's AdaBoost.MH boosting algorithm is applied to the Word Sense Disambiguation (WSD) problem. Initial experiments