522 search results - page 19 / 105 » Energy Models for Graph Clustering |
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
KDD
2004
ACM
16 years 3 days ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
VISUALIZATION
2000
IEEE
15 years 4 months ago
2000
IEEE
A new method for the simplification of flow fields is presented. It is based on continuous clustering. A well-known physical clustering model, the Cahn Hillard model which desc...
CIVR
2005
Springer
15 years 5 months ago
2005
Springer
This paper proposes a new approach for hot event detection and summarization of news videos. The approach is mainly based on two graph algorithms: optimal matching (OM) and normali...
CIE
2010
Springer
15 years 4 months ago
2010
Springer
This paper discusses the use of spatial graph models for the analysis of networks that do not have a direct spatial reality, such as web graphs, on-line social networks, or citatio...