554 search results - page 33 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
For video summarization and retrieval, one of the important modules is to group temporal-spatial coherent shots into high-level semantic video clips namely scene segmentation. In ...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
MICCAI
2000
Springer
14 years 10 days ago
2000
Springer
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...
ICPADS
2007
IEEE
14 years 3 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
GD
2003
Springer
14 years 2 months ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...