The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Background: The enumeration of tetrameric and other sequence motifs that are positively or negatively correlated with in vivo antisense DNA effects has been a useful addition to t...
Donald M. Gray, Carla W. Gray, Byong-Hoon Yoo, Tzu...
— This paper proposes a neural network model capable of completing partly occluded contours. The model is a hierarchical multi-layered network. Using the responses of bend-extrac...
In recent years, text classification in sentiment analysis has mostly focused on two types of classification, the distinction between objective and subjective text, i.e. subjectiv...