3055 search results - page 288 / 611 » Randomized Search Trees |
130
click to vote
BTW
2005
Springer
15 years 9 months ago
2005
Springer
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
136
Voted
SOCO
2010
Springer
2010
Springer
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
15 years 1 months ago
Local genetic algorithms have been designed with the aim of providing effective intensiļ¬cation. One of their most outstanding features is that they may help classical local searc...
105
click to vote
KDD
1998
ACM
15 years 7 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
111
Voted
ADMA
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
124
Voted
UAI
2004
15 years 4 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...