1951 search results - page 260 / 391 » An algorithm for improving graph partitions |
155
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
146
click to vote
PKDD
2010
Springer
15 years 2 months ago
2010
Springer
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information net...
132
click to vote
ICIP
2006
IEEE
16 years 6 months ago
2006
IEEE
In this paper we propose a method for extending the standard motion estimation algorithms used in video compression algorithms, to incorporate motion parameters that describe non-...
152
click to vote
PAMI
2007
15 years 4 months ago
2007
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
149
click to vote
STOC
2003
ACM
16 years 4 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 ...