649 search results - page 42 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
145
click to vote
CIVR
2005
Springer
15 years 11 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...
145
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
163
click to vote
TSP
2008
15 years 5 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
145
Voted
GD
2005
Springer
15 years 11 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
150
click to vote
PVLDB
2010
15 years 3 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...