Method for partial matching of data makes conventional electronic memory addressable via its contents. When implemented by suitable algorithm, method enables computer system containing memory to search memory for datum making exact or best approximate match to datum in query. Advantages are: requires neither long "learning" time nor "retraining" when additional data stored and attaches to each datum relative importance that can change with time without decreasing speed of retrieval. Responses include exact or approximate recollection, indications of ambiguity, avoidance, and even forgetfulness.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Flexible Weighting-And-Matching Scheme For Incomplete Data


    Contributors:

    Published in:

    Publication date :

    1993-03-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English




    Weighting of Data

    Ampt, E. | British Library Conference Proceedings | 1992



    Successive Interference Canceller with CSI Weighting Combining Scheme

    Katsuda, Hajime / Ohmori, Seiji / Akabane, Kazunori | IEEE | 2016


    A Map Matching Algorithm Combining Twice Gridding and Weighting Factors Methods

    Cao, Ketu / Wang, Lixiao / Zuo, Zhi et al. | TIBKAT | 2019


    RF^*IPF: A Weighting Scheme for Multimedia Information Retrieval

    Wang, J. / Du, Y. / IEEE | British Library Conference Proceedings | 2001