4342 search results - page 569 / 869 » Improved Algorithms for Optimal Embeddings |
156
click to vote
ICDAR
2003
IEEE
16 years 11 hour ago
2003
IEEE
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
177
click to vote
EMO
2003
Springer
15 years 12 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
170
click to vote
FAW
2009
Springer
15 years 11 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
183
click to vote
SIGMOD
1989
ACM
15 years 10 months ago
1989
ACM
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads ...
163
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive) are dyn...