1963 search results - page 227 / 393 » The Maximum Solution Problem on Graphs |
160
click to vote
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
135
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
128
click to vote
ICALP
1992
Springer
15 years 7 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
144
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
138
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...