248 search results - page 22 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
107
click to vote
ISITA
2010
14 years 9 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
TIP
2008
14 years 11 months ago
2008
Density estimation for observational data plays an integral role in a broad spectrum of applications, e.g. statistical data analysis and information-theoretic image registration. ...
105
click to vote
SDM
2010
SIAM
14 years 10 months ago
2010
SIAM
In this paper, we consider the problem of community detection in directed networks by using probabilistic models. Most existing probabilistic models for community detection are ei...
CCCG
2009
15 years 26 days ago
2009
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...
96
Voted
STOC
2007
ACM
16 years 2 days ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...