A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
In recent years, while search engines have become more and more powerful, several specialized search engines have been developed for different domains (e.g. library services, serv...
Digital colour image enhancement using a homomorphic filter provides good dynamic range compression, but it fails in colour rendition. In this letter, we propose to perform natura...
- Our paper focuses on the generation of optimal test sequences and test cases using Intelligent Agents for highly reliable systems. Test sequences support test case generation for...
Linear support vector machines (SVM) are useful for classifying large-scale sparse data. Problems with sparse features are common in applications such as document classification a...