Sciweavers

2834 search results - page 112 / 567
» Representing Trees with Constraints
Sort
View
JDCTA
2010
151views more  JDCTA 2010»
13 years 5 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Jianwei Wang, Zhongxiao Hao
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 3 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 10 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
BMCBI
2011
13 years 5 months ago
Tree Pruner: An efficient tool for selecting data from a biased genetic database
Background: Large databases of genetic data are often biased in their representation. Thus, selection of genetic data with desired properties, such as evolutionary representation ...
Mohan Krishnamoorthy, Pragneshkumar Patel, Mira Di...
HUMO
2007
Springer
14 years 4 months ago
Boosted Multiple Deformable Trees for Parsing Human Poses
Tree-structured models have been widely used for human pose estimation, in either 2D or 3D. While such models allow efficient learning and inference, they fail to capture additiona...
Yang Wang 0003, Greg Mori