2137 search results - page 137 / 428 » Experiments on Graph Clustering Algorithms |
JGAA
2002
14 years 9 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
95
Voted
DAGM
2008
Springer
14 years 12 months ago
2008
Springer
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
78
Voted
ECRTS
2003
IEEE
15 years 3 months ago
2003
IEEE
When time-triggered (TT) systems are to be deployed for large embedded real-time (RT) control systems in cars and airplanes, one way to overcome bandwidth limitations and achieve ...
ICWSM
2009
14 years 7 months ago
2009
Events and stories can be characterized by a set of descriptive, collocated keywords. Intuitively, documents describing the same event will contain similar sets of keywords, and t...