2283 search results - page 95 / 457 » Bounds of Graph Characteristics |
IJCAI
2007
13 years 9 months ago
2007
Accurate entity resolution is sometimes impossible simply due to insufficient information. For example, in research paper author name resolution, even clever use of venue, title ...
GC
2007
Springer
13 years 8 months ago
2007
Springer
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
NIPS
1998
13 years 9 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
EJC
2008
13 years 8 months ago
2008
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...