Sciweavers

613 search results - page 44 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
MIR
2006
ACM
172views Multimedia» more  MIR 2006»
14 years 1 months ago
Combining audio-based similarity with web-based data to accelerate automatic music playlist generation
We present a technique for combining audio signal-based music similarity with web-based musical artist similarity to accelerate the task of automatic playlist generation. We demon...
Peter Knees, Tim Pohle, Markus Schedl, Gerhard Wid...
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 9 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
ICML
2007
IEEE
14 years 8 months ago
Dimensionality reduction and generalization
In this paper we investigate the regularization property of Kernel Principal Component Analysis (KPCA), by studying its application as a preprocessing step to supervised learning ...
Sofia Mosci, Lorenzo Rosasco, Alessandro Verri
EVOW
2004
Springer
14 years 1 months ago
Improving Edge Recombination through Alternate Inheritance and Greedy Manner
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...
Chuan-Kang Ting