1376 search results - page 107 / 276 » Searching Trees: An Essay |
192
click to vote
ECIR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
169
click to vote
CCCG
2001
15 years 7 months ago
2001
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
170
click to vote
EMNLP
2009
15 years 4 months ago
2009
This paper explores two classes of model adaptation methods for Web search ranking: Model Interpolation and error-driven learning approaches based on a boosting algorithm. The res...
152
click to vote
AAAI
2007
15 years 8 months ago
2007
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
171
click to vote
ICANN
2010
Springer
15 years 7 months ago
2010
Springer
We propose a new approach for reinforcement learning in problems with continuous actions. Actions are sampled by means of a diffusion tree, which generates samples in the continuou...