222 search results - page 23 / 45 » The Parameterized Complexity of Regular Subgraph Problems an... |
ISAAC
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We consider the minimization of a smooth convex function regularized by the mixture of prior models. This problem is generally difficult to solve even each simpler regula...
UAI
2004
13 years 9 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
TOG
2008
13 years 7 months ago
2008
Modeling the large space of possible human motions requires scalable techniques. Generalizing from example motions or example controllers is one way to provide the required scalab...