2600 search results - page 248 / 520 » Clustering with or without the Approximation |
192
click to vote
FLAIRS
2010
15 years 4 months ago
2010
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
196
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We present a speech pre-processing scheme (SPPS) for robust speech recognition in the moving motorcycle environment. The SPPS is dynamically adapted during the run-time operation ...
305
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
140
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We consider the problem of choosing, sequentially, a map which assigns elements of a set A to a few elements of a set B. On each round, the algorithm suffers some cost associated ...
174
click to vote
MICAI
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...