The K-nearest neighbor (KNN) algorithm is one of the most extensively used classification
algorithms, while its high time complexity limits its performance in the era of big data. The …

In this paper, we develop compositional vector-based semantics of positive transitive
sentences using quantum natural language processing (Q-NLP) to compare the …

The Family Traveling Salesperson Problem (FTSP) is a variant of the Traveling Salesperson
Problem (TSP), in which all vertices are divided into several different families, and the goal …

A dominating set of a graph G=(V, E) is a subset U of its vertices V, such that any vertex of G
is either in U, or has a neighbor in U. The dominating-set problem is to find a minimum …

The article discusses emerging non-von Neumann computer architectures and their
integration in the computing continuum for supporting modern distributed applications …

Quantum computers, known to have the potential for exponential speedup in solving some
problems due to their superposition property, are expected to facilitate the solution of NP …

The increasing growth of data volume, and the consequent explosion in demand for
computational power, are affecting scientific computing, as shown by the rise of extreme …

DNA computing is a new pattern of computing that combines biotechnology and information
technology. As a new technology born in less than three decades, it has developed at an …

Background: A series of novel oligomers with various types and complex skeletons are
isolated from Annonaceae plants, which displayed anti-inflammatory, antimalarial …

The data volume of global information has grown exponentially in recent years, but the
development of silicon-based memory has entered a bottleneck period. Deoxyribonucleic …