We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
The use of unsupervised fuzzy learning methods produces a large number of alternative classifications. This paper presents and analyzes a series of criteria to select the most sui...
Feature selection is a data preprocessing step for classi cation and data mining tasks. Traditionally, feature selection is done by selecting a minimum number of features that det...
The vision of a Semantic Web has recently drawn considerable attention, both from academia and industry. Description Logics are often named as one of the tools that can support th...