The problem of passive localization is commonly solved by independently measuring intermediate parameters (such as angles of arrival (AOA), times of arrival (TOA)...) on several m...
— We discuss sparse support vector machines (sparse SVMs) trained in the reduced empirical feature space. Namely, we select the linearly independent training data by the Cholesky...
In this paper, we introduce a technique for applying Independent Component Analysis to vector space representations of software code fragments such as methods or blocks. The dista...
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...