14779 search results - page 297 / 2956 » On Ultrametric Algorithmic Information |
172
click to vote
AAAI
2006
15 years 8 months ago
2006
We use game theory to analyze meta-learning algorithms. The objective of meta-learning is to determine which algorithm to apply on a given task. This is an instance of a more gene...
166
click to vote
IPL
2008
15 years 6 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
159
click to vote
ECIR
2009
Springer
16 years 3 months ago
2009
Springer
This paper presents a new approach designed to reduce the computational load of the existing clustering algorithms by trimming down the documents size using fingerprinting methods...
153
Voted
ISMIR
2005
Springer
16 years 5 days ago
2005
Springer
This paper focuses on gathering similarity ratings for use in the construction, optimization and evaluation of melodic similarity algorithms. The approach involves conducting list...
129
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...