Sciweavers

9 search results - page 2 / 2
» On the approximability of two tree drawing conventions
Sort
View
COMPGEOM
2006
ACM
13 years 11 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
BMCBI
2007
134views more  BMCBI 2007»
13 years 5 months ago
Benchmarking natural-language parsers for biological applications using dependency graphs
Background: Interest is growing in the application of syntactic parsers to natural language processing problems in biology, but assessing their performance is difficult because di...
Andrew B. Clegg, Adrian J. Shepherd
BMCBI
2010
178views more  BMCBI 2010»
13 years 5 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
GECCO
2003
Springer
13 years 10 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell