205 search results - page 17 / 41 » Efficient Algorithms for Universal Portfolios |
110
click to vote
APPROX
2010
Springer
14 years 6 months ago
2010
Springer
d Abstract) Thomas P. Hayes1 and Alistair Sinclair2 1 Department of Computer Science, University of New Mexico 2 Computer Science Division, University of California at Berkeley A &...
116
click to vote
SWAT
1992
Springer
15 years 3 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
148
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
102
click to vote
IJCGA
2008
14 years 11 months ago
2008
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
AUSAI
2003
Springer
15 years 5 months ago
2003
Springer
We have recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics so as to find...