Sciweavers

4095 search results - page 77 / 819
» How to test a tree
Sort
View
ACL
2010
13 years 7 months ago
Edit Tree Distance Alignments for Semantic Role Labelling
Tree SRL system is a Semantic Role Labelling supervised system based on a tree-distance algorithm and a simple k-NN implementation. The novelty of the system lies in comparing the...
Hector-Hugo Franco-Penya
IIE
2007
159views more  IIE 2007»
13 years 9 months ago
Creating and Visualizing Test Data from Programming Exercises
Automatic assessment of programming exercises is typically based on testing approach. Most automatic assessment frameworks execute tests and evaluate test results automatically, bu...
Petri Ihantola
BMCBI
2007
172views more  BMCBI 2007»
13 years 9 months ago
msBayes: Pipeline for testing comparative phylogeographic histories using hierarchical approximate Bayesian computation
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
Michael J. Hickerson, Eli Stahl, Naoki Takebayashi
IJCV
2007
115views more  IJCV 2007»
13 years 9 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
LATIN
2010
Springer
14 years 3 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...