1729 search results - page 113 / 346 » On Bounds for the k-Partitioning of Graphs |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
64
Voted
IJCAI
2007
14 years 11 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
14 years 10 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
15 years 11 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
14 years 11 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...