Sciweavers

1068 search results - page 97 / 214
» Extremely randomized trees
Sort
View
CLUSTER
2009
IEEE
14 years 4 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...
SRDS
2005
IEEE
14 years 3 months ago
Distributed Construction of a Fault-Tolerant Network from a Tree
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
Michael K. Reiter, Asad Samar, Chenxi Wang
HIPC
2005
Springer
14 years 3 months ago
Orthogonal Decision Trees for Resource-Constrained Physiological Data Stream Monitoring Using Mobile Devices
Several challenging new applications demand the ability to do data mining on resource constrained devices. One such application is that of monitoring physiological data streams ob...
Haimonti Dutta, Hillol Kargupta, Anupam Joshi
CIKM
2008
Springer
14 years 47 min ago
A new method for indexing genomes using on-disk suffix trees
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
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...