Sciweavers

1640 search results - page 73 / 328
» Conditional Independence Trees
Sort
View
109
Voted
CLUSTER
2009
IEEE
15 years 9 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,...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 4 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
ML
2006
ACM
163views Machine Learning» more  ML 2006»
15 years 2 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
184
Voted
TCIAIG
2010
14 years 9 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...
212
Voted
ICDE
2006
IEEE
181views Database» more  ICDE 2006»
16 years 4 months ago
Adaptive Reorganization of Coherency-Preserving Dissemination Tree for Streaming Data
In many recent applications, data are continuously being disseminated from a source to a set of servers. In this paper, we propose a cost-based approach to construct dissemination...
Yongluan Zhou, Beng Chin Ooi, Kian-Lee Tan, Feng Y...