Sciweavers

4095 search results - page 62 / 819
» How to test a tree
Sort
View
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 8 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
HICSS
2007
IEEE
131views Biometrics» more  HICSS 2007»
14 years 2 months ago
The Use of Attack and Protection Trees to Analyze Security for an Online Banking System
Online banking has become increasingly important to the profitability of financial institutions as well as adding convenience for their customers. As the number of customers using...
Kenneth S. Edge, Richard A. Raines, Michael R. Gri...
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
14 years 1 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
WABI
2004
Springer
107views Bioinformatics» more  WABI 2004»
14 years 1 months ago
Phylogenetic Super-networks from Partial Trees
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
Daniel H. Huson, Tobias Dezulian, Tobias H. Kl&oum...
COLING
2008
13 years 9 months ago
Integrating a Unification-Based Semantics in a Large Scale Lexicalised Tree Adjoining Grammar for French
In contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Grammar (TAG) equiped with a compositional semantics. In this paper, we report on the integration of a ...
Claire Gardent