Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Many behavioural experiments have pointed out the important role played by the hippocampus in spatial navigation. This role was enlightened by the discovery of hippocampal cells i...
This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA). For many real-world applications...
Feature selection is an important preprocessing step in mining high-dimensional data. Generally, supervised feature selection methods with supervision information are superior to ...