Sciweavers

310 search results - page 27 / 62
» Randomized Binary Search Trees
Sort
View
ICIP
2010
IEEE
13 years 7 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao
EUROGP
2010
Springer
330views Optimization» more  EUROGP 2010»
14 years 4 months ago
Bandit-Based Genetic Programming
We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical prope...
Jean-Baptiste Hoock, Olivier Teytaud
TCIAIG
2010
13 years 4 months ago
Monte Carlo Tree Search in Hex
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's ...
Broderick Arneson, Ryan B. Hayward, Philip Henders...
COLING
1996
13 years 11 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer
WADS
2009
Springer
257views Algorithms» more  WADS 2009»
14 years 4 months ago
Rank-Balanced Trees
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...