301 search results - page 34 / 61 » On Finding Dense Subgraphs |
98
Voted
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
BPM
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
ALGORITHMICA
2005
14 years 9 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
123
click to vote
Publication
Images with large areas of low texture pose significant challenge to stereo algorithms. We propose a novel segmentation based stereo scheme tuned to handle such scenes. We combine ...
449
click to vote
Tutorial
Correlation based matching typically produces dense depth maps by calculating the disparity at each pixel within a neighborhood. This is achieved by taking a square window of certa...