1221 search results - page 114 / 245 » Balanced graph partitioning |
148
click to vote
AGTIVE
2003
Springer
15 years 8 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
125
click to vote
UAI
2003
15 years 4 months ago
2003
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
130
click to vote
ECCV
1994
Springer
16 years 4 months ago
1994
Springer
Most of the work achieved thus far on aspect graphs has concentrated on the design of algorithms for computing the representation. After reviewing how the space of viewpoints can b...
112
click to vote
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
For a graph , subgroups M < G Aut(), and an edge partition E of , the pair (, E) is a (G, M)-homogeneous factorisation if M is vertex-transitive on and fixes setwise each part...
117
click to vote
ACL
2006
15 years 4 months ago
2006
An unsupervised part-of-speech (POS) tagging system that relies on graph clustering methods is described. Unlike in current state-of-the-art approaches, the kind and number of dif...