This paper describes a more efficient paired comparison method that reduces the number of trials necessary for converting a table of paired comparisons into scalar data. Instead o...
—In this paper, a new sorting initial codebook algorithm for learning vector quantization (LVQ) based upon selforganizing feature maps (SOM) has been proposed. The basic idea is ...
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous aut...