Sciweavers

336 search results - page 25 / 68
» Analytic Cut Trees
Sort
View
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 7 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
2010
143views more  BMCBI 2010»
13 years 7 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
ICMCS
2007
IEEE
101views Multimedia» more  ICMCS 2007»
14 years 1 months ago
View-Dependent Visibility Estimation for Tree Models
— A view-dependent visibility estimation technique for tree models is proposed in this work. While most previous work focused on visibility estimation of large objects in archite...
Jessy Lee, Jingliang Peng, C. C. Jay Kuo
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 5 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
SIGMETRICS
2009
ACM
149views Hardware» more  SIGMETRICS 2009»
14 years 2 months ago
On the treeness of internet latency and bandwidth
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Inte...
Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian...