590 search results - page 52 / 118 » Can We Learn to Beat the Best Stock |
100
click to vote
IEE
2002
14 years 9 months ago
2002
Projects where developers are geographically distributed and with high personnel turnover are usually considered to be hard to manage. Any organisation that successfully handles s...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
The problem of nonlinear dimensionality reduction is considered. We focus on problems where prior information is available, namely, semi-supervised dimensionality reduction. It is...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
We investigate how random projection can best be used for clustering high dimensional data. Random projection has been shown to have promising theoretical properties. In practice,...
ICMLA
2009
14 years 7 months ago
2009
For many ranking applications we would like to understand not only which items are top-ranked, but also why they are top-ranked. However, many of the best ranking algorithms (e.g....
MLG
2007
Springer
15 years 4 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...