743 search results - page 132 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
TAMC
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
COLT
2010
Springer
13 years 6 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...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...