796 search results - page 114 / 160 » Approximating the centroid is hard |
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
IGARSS
2010
13 years 2 months ago
2010
This paper investigates the performance of machine learning methods for classifying rock types from hyperspectral data. The main objective is to test the impact on classification ...
TEC
2010
13 years 2 months ago
2010
-- We encounter optimization problems in our daily lives and in various research domains. Some of them are so hard that we can, at best, approximate the best solutions with (meta-)...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper we present a novel approach to acoustic model training for non-audible murmur (NAM) recognition using normal speech data transformed into NAM data. NAM is extremely ...