Sciweavers

1199 search results - page 7 / 240
» Robust inference of trees
Sort
View
POPL
2009
ACM
14 years 10 months ago
Flexible types: robust type inference for first-class polymorphism
We present HML, a type inference system that supports full firstclass polymorphism where few annotations are needed: only function parameters with a polymorphic type need to be an...
Daan Leijen
ADAC
2010
105views more  ADAC 2010»
13 years 10 months ago
Inference for robust canonical variate analysis
We consider the problem of optimally separating two multivariate populations. Robust linear discriminant rules can be obtained by replacing the empirical means and covariance in th...
Stefan Van Aelst, Gert Willems
EOR
2006
110views more  EOR 2006»
13 years 10 months ago
Scatter search with path relinking for phylogenetic inference
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
Carlos Cotta
EOR
2006
130views more  EOR 2006»
13 years 10 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
JMLR
2010
118views more  JMLR 2010»
13 years 4 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano