In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

In this paper we evaluate a selection of data retrieval algorithms for storage e ciency retrieval speed and partial matching capabilities using a large information retrieval dataset We evaluate standard data structures for example inverted le lists and hash tables but also a novel binary neu ral network that incorporates single epoch training superimposed coding and associative matching in a bi...

In this paper we evaluate a selection of data retrieval algorithms for storage efficiency, retrieval speed and partial matching capabilities using a large Information Retrieval dataset. We evaluate standard data structures, for example inverted file lists and hash tables, but also a novel binary neural network that incorporates: single-epoch training, superimposed coding and associative matchin...

schema matching is a critical step in many applications, such as data warehouse loading, online analytical process (olap), data mining, semantic web [2] and schema integration. this task is defined for finding the semantic correspondences between elements of two schemas. recently, schema matching has found considerable interest in both research and practice. in this paper, we present a new impr...