Sciweavers

1237 search results - page 55 / 248
» Abstract shade trees
Sort
View
JSYML
2006
60views more  JSYML 2006»
15 years 4 months ago
Counterexamples to the unique and cofinal branches hypotheses
Abstract. We produce counterexamples to the unique and cofinal branches hypotheses, assuming (slightly less than) the existence of a cardinal which is strong past a Woodin cardinal...
Itay Neeman, John R. Steel
RECOMB
2006
Springer
16 years 4 months ago
Maximal Accurate Forests from Distance Matrices
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...
Constantinos Daskalakis, Cameron Hill, Alexander J...
130
Voted
EDBT
2006
ACM
130views Database» more  EDBT 2006»
16 years 4 months ago
Querying and Updating Probabilistic Information in XML
Abstract. We present in this paper a new model for representing probabilistic information in a semi-structured (XML) database, based on the use of probabilistic event variables. Th...
Serge Abiteboul, Pierre Senellart
IWOCA
2009
Springer
134views Algorithms» more  IWOCA 2009»
15 years 11 months ago
Combinatorial Models for Cooperation Networks
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
128
Voted
HASKELL
2009
ACM
15 years 11 months ago
Alloy: fast generic transformations for Haskell
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...
Neil C. C. Brown, Adam T. Sampson