3055 search results - page 283 / 611 » Randomized Search Trees |
107
click to vote
IJCAI
2007
15 years 4 months ago
2007
Occam’s razor is the principle that, given two hypotheses consistent with the observed data, the simpler one should be preferred. Many machine learning algorithms follow this pr...
123
click to vote
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
119
Voted
CG
2002
Springer
15 years 3 months ago
2002
Springer
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
149
Voted
HICSS
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract— Recent advances in graph-based search techniques derived from Kleinberg’s work [1] have been impressive. This paper further improves the graph-based search algorithm ...
141
click to vote
JCB
2002
15 years 3 months ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...