248 search results - page 34 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
101
click to vote
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
98
Voted
ICA
2004
Springer
15 years 5 months ago
2004
Springer
SOBI is a blind source separation algorithm based on time decorrelation. It uses multiple time autocovariance matrices, and performs joint diagonalization thus being more robust th...
174
Voted
POPL
2005
ACM
16 years 2 days ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
SIGGRAPH
1999
ACM
15 years 4 months ago
1999
ACM
We present a new method for user controlled morphing of two homeomorphic triangle meshes of arbitrary topology. In particular we focus on the problem of establishing a corresponde...
IJAR
2010
14 years 10 months ago
2010
Bayesian networks with mixtures of truncated exponentials (MTEs) support efficient inference algorithms and provide a flexible way of modeling hybrid domains (domains containing ...