Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
This paper explores the application of ordered weighted averaging (OWA) operators to develop water quality index, which incorporates an attitudinal dimension in the aggregation pr...
We have recently introduced an incremental learning algorithm, Learn++ .NSE, for Non-Stationary Environments, where the data distribution changes over time due to concept drift. Le...