Results 1  10
of
135,673
TROPICAL MIXTURES OF STAR TREE METRICS
, 907
"... Abstract. We study tree metrics that can be realized as a mixture of two star tree metrics. We prove that the only trees admitting such a decomposition are the ones having only one internal edge and, moreover, certain relations among the weights assigned to all edges must hold. We also describe the ..."
Abstract
 Add to MetaCart
Abstract. We study tree metrics that can be realized as a mixture of two star tree metrics. We prove that the only trees admitting such a decomposition are the ones having only one internal edge and, moreover, certain relations among the weights assigned to all edges must hold. We also describe
Spanning Star Trees In Regular Graphs
"... For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If S(W ) is a tree containing all the vertices of G, then we call it a spanning star tree of G. I ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If S(W ) is a tree containing all the vertices of G, then we call it a spanning star tree of G
Maximum Likelihood Phylogenetic Estimation from DNA Sequences with Variable Rates over Sites: Approximate Methods
 J. Mol. Evol
, 1994
"... Two approximate methods are proposed for maximum likelihood phylogenetic estimation, which allow variable rates of substitution across nucleotide sites. Three data sets with quite different characteristics were analyzed to examine empirically the performance of these methods. The first, called ..."
Abstract

Cited by 540 (28 self)
 Add to MetaCart
to their rates predicted assuming the star tree. Sites in different classes are then assumed to be evolving at these fixed rates when other tree topologies are evaluated.
ZTree: Zurich Toolbox for Readymade Economic Experiments, Working paper No
, 1999
"... 2.2.2 Startup of the Experimenter PC............................................................................................... 9 2.2.3 Startup of the Subject PCs....................................................................................................... 9 ..."
Abstract

Cited by 1956 (33 self)
 Add to MetaCart
2.2.2 Startup of the Experimenter PC............................................................................................... 9 2.2.3 Startup of the Subject PCs....................................................................................................... 9
Selfadjusting binary search trees
, 1985
"... The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have an am ..."
Abstract

Cited by 435 (19 self)
 Add to MetaCart
The splay tree, a selfadjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an nnode splay tree, all the standard search tree operations have
Labeled Packing of Non Star Tree into its Fifth Power and Sixth Power
"... In this paper we prove that we can find a labeled packing of a non star tree T into T 6 with mT + dn−mT5 e labels, where n is the number of vertices of T and mT is the maximum number of leaves that can be removed from T in such a way that the obtained graph is a non star tree. Also, we prove that we ..."
Abstract
 Add to MetaCart
In this paper we prove that we can find a labeled packing of a non star tree T into T 6 with mT + dn−mT5 e labels, where n is the number of vertices of T and mT is the maximum number of leaves that can be removed from T in such a way that the obtained graph is a non star tree. Also, we prove
Scalable Application Layer Multicast
, 2002
"... We describe a new scalable applicationlayer multicast protocol, specifically designed for lowbandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the applicationlayer multicast peers and can support a number of different data deliv ..."
Abstract

Cited by 719 (21 self)
 Add to MetaCart
delivery trees with desirable properties. We present extensive simulations of both our protocol and the Narada applicationlayer multicast protocol over Internetlike topologies. Our results show that for groups of size 32 or more, our protocol has lower link stress (by about 25%), improved or similar
Secure Group Communications Using Key Graphs
, 1998
"... Many emerging applications (e.g., teleconference, realtime information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of au ..."
Abstract

Cited by 552 (17 self)
 Add to MetaCart
Many emerging applications (e.g., teleconference, realtime information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of authorized receivers. As a result, securing group communications (i.e., providing confidentiality, integrity, and authenticity of messages delivered between group members) will become a critical networking issue. In this paper, we present a novel solution to the scalability problem of group/multicast key management. We formalize the notion of a secure group as a triple (U; K;R) where U denotes a set of users, K a set of keys held by the users, and R a userkey relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join/leave, and specify protocols for joining and leaving a...
The CN2 Induction Algorithm
 MACHINE LEARNING
, 1989
"... Systems for inducing concept descriptions from examples are valuable tools for assisting in the task of knowledge acquisition for expert systems. This paper presents a description and empirical evaluation of a new induction system, cn2, designed for the efficient induction of simple, comprehensib ..."
Abstract

Cited by 884 (6 self)
 Add to MetaCart
Systems for inducing concept descriptions from examples are valuable tools for assisting in the task of knowledge acquisition for expert systems. This paper presents a description and empirical evaluation of a new induction system, cn2, designed for the efficient induction of simple, comprehensible production rules in domains where problems of poor description language and/or noise may be present. Implementations of the cn2, id3 and aq algorithms are compared on three medical classification tasks.
Results 1  10
of
135,673