Results 1  10
of
1,308
Beyond Trees
, 2000
"... This paper addresse the question: what is the best way to describe the structure which is generated by a grammar of this third class? This being, naturally, a prior question to de ning the grammar itself, and just as much a matter of mathematical formalism than of linguistic /coginitive realism ..."
Abstract
 Add to MetaCart
This paper addresse the question: what is the best way to describe the structure which is generated by a grammar of this third class? This being, naturally, a prior question to de ning the grammar itself, and just as much a matter of mathematical formalism than of linguistic /coginitive realism
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 663 (38 self)
 Add to MetaCart
A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion
Phylogenetic graph models beyond trees
, 2007
"... A graph model for a set S of splits of a set X consists of a graph and a map from X to the vertices of the graph such that the inclusionminimal cuts of the graph represent S. Phylogenetic trees are graph models in which the graph is a tree. We show that the model can be generalized to a cactus (i.e ..."
Abstract
 Add to MetaCart
A graph model for a set S of splits of a set X consists of a graph and a map from X to the vertices of the graph such that the inclusionminimal cuts of the graph represent S. Phylogenetic trees are graph models in which the graph is a tree. We show that the model can be generalized to a cactus (i
Definition of tanβ beyond treelevel ∗
, 1996
"... We study the relation between different renormalization schemes for the parameter tan β in the Minimal Supersymmetric Standard Model. The contributions of the thirdgeneration quarksquark loops to the differences between tanβ’s in several schemes are discussed. Their numerical differences are typic ..."
Abstract
 Add to MetaCart
We study the relation between different renormalization schemes for the parameter tan β in the Minimal Supersymmetric Standard Model. The contributions of the thirdgeneration quarksquark loops to the differences between tanβ’s in several schemes are discussed. Their numerical differences are typically within several %.
Multicast Routing in Datagram Internetworks and Extended LANs
 ACM Transactions on Computer Systems
, 1990
"... Multicasting, the transmission of a packet to a group of hosts, is an important service for improving the efficiency and robustness of distributed systems and applications. Although multicast capability is available and widely used in local area networks, when those LANs are interconnected by store ..."
Abstract

Cited by 1074 (5 self)
 Add to MetaCart
andforward routers, the multicast service is usually not offered across the resulting internetwork. To address this limitation, we specify extensions to two common internetwork routing algorithmsdistancevector routing and linkstate routingto support lowdelay datagram multicasting beyond a single LAN. We also
Width parameters beyond treewidth and their applications
 Computer Journal
, 2007
"... Besides the very successful concept of treewidth (see [Bodlaender, H. and Koster, A. (2007) Combinatorial optimisation on graphs of bounded treewidth. These are special issues on Parameterized Complexity]), many concepts and parameters measuring the similarity or dissimilarity of structures compare ..."
Abstract

Cited by 40 (0 self)
 Add to MetaCart
Besides the very successful concept of treewidth (see [Bodlaender, H. and Koster, A. (2007) Combinatorial optimisation on graphs of bounded treewidth. These are special issues on Parameterized Complexity]), many concepts and parameters measuring the similarity or dissimilarity of structures
Lipatov’s Action Beyond Tree Level
"... Abstract. Computations in QuasiMultiRegge kinematics are much simplified using an effective theory pioneered by Lipatov. This highenergy effective theory does not come from an integrating out procedure, and suitable counterterms and regularization have to be provided beyond tree level. In this no ..."
Abstract
 Add to MetaCart
Abstract. Computations in QuasiMultiRegge kinematics are much simplified using an effective theory pioneered by Lipatov. This highenergy effective theory does not come from an integrating out procedure, and suitable counterterms and regularization have to be provided beyond tree level
Beyond Trees: MRF Inference via OuterPlanar Decomposition
, 2010
"... Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NPhard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. trees), or approximate algorithms (e.g. Loopy Belief Propagation (BP) and Treereweighted (TRW) methods). This paper prese ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
global solution. This provides a new way of thinking about BP and TRW as successive steps in a hierarchy of decomposition methods. Using this framework, we take a principled first step towards extending this hierarchy beyond trees. We leverage a new class of graphs amenable to exact inference, called
Beyond trees: Common factor models for 2D human pose recovery
 In ICCV
, 2005
"... Tree structured models have been widely used for determining the pose of a human body, from either 2D or 3D data. While such models can effectively represent the kinematic constraints of the skeletal structure, they do not capture additional constraints such as coordination of the limbs. Tree struct ..."
Abstract

Cited by 66 (1 self)
 Add to MetaCart
Tree structured models have been widely used for determining the pose of a human body, from either 2D or 3D data. While such models can effectively represent the kinematic constraints of the skeletal structure, they do not capture additional constraints such as coordination of the limbs. Tree
Beyond Trees: MAP Inference in MRFs via OuterPlanar Decomposition
"... Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NPhard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. trees), or approximate algorithms (e.g. Loopy Belief Propagation (BP) and Treereweighted (TRW) methods). This paper pre ..."
Abstract
 Add to MetaCart
global solution. This provides a new way of thinking about BP and TRW as successive steps in a hierarchy of decomposition methods. Using this framework, we take a principled first step towards extending this hierarchy beyond trees. We leverage a new class of graphs amenable to exact inference, called
Results 1  10
of
1,308