214 search results - page 7 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
107
click to vote
JDA
2007
14 years 10 months ago
2007
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
73
Voted
SIAMCOMP
1998
14 years 9 months ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
162
Voted
VLDB
2006
ACM
15 years 10 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
IPCO
2010
14 years 8 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...