Sciweavers

1199 search results - page 30 / 240
» Robust inference of trees
Sort
View
NIPS
2001
14 years 16 days ago
Thin Junction Trees
We present an algorithm that induces a class of models with thin junction trees--models that are characterized by an upper bound on the size of the maximal cliques of their triang...
Francis R. Bach, Michael I. Jordan
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 8 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
COMCOM
2006
110views more  COMCOM 2006»
13 years 11 months ago
MULTI+: A robust and topology-aware peer-to-peer multicast service
TOPLUS is a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. In this paper we present MULT...
Luis Garcés-Erice, Ernst W. Biersack
CORR
2011
Springer
235views Education» more  CORR 2011»
13 years 6 months ago
On the accuracy of language trees
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
Simone Pompei, Vittorio Loreto, Francesca Tria
ITA
2007
101views Communications» more  ITA 2007»
13 years 11 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau