837 search results - page 7 / 168 » Hard combinators |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Modern monaural voice and accompaniment separation systems usually consist of two main modules: melody extraction and timefrequency masking. A main distinction between different s...
APPROX
2008
Springer
15 years 3 days ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
102
click to vote
ICTAI
2010
IEEE
14 years 7 months ago
2010
IEEE
Planning techniques recorded a significant progress during recent years. However, many planning problems remain still hard even for modern planners. One of the most promising appro...
ICANN
2009
Springer
15 years 2 months ago
2009
Springer
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
KDD
2005
ACM
15 years 3 months ago
2005
ACM
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...