Sciweavers

40 search results - page 3 / 8
» On Conditional Branches in Optimal Decision Trees
Sort
View
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 7 days ago
Subexponential convergence for information aggregation on regular trees
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
Yashodhan Kanoria, Andrea Montanari
DCC
2007
IEEE
14 years 4 months ago
Bayesian Detection in Bounded Height Tree Networks
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards th...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
CCE
2008
13 years 5 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
13 years 10 months ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
André Leier, Wolfgang Banzhaf
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 2 days ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...