Sciweavers

310 search results - page 24 / 62
» Cutting two graphs simultaneously
Sort
View
SIGSOFT
2010
ACM
13 years 6 months ago
Language-based replay via data flow cut
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
Ming Wu, Fan Long, Xi Wang, Zhilei Xu, Haoxiang Li...
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
11 years 11 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
CVPR
2006
IEEE
14 years 3 months ago
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inf...
Carsten Rother, Thomas P. Minka, Andrew Blake, Vla...
IV
2010
IEEE
193views Visualization» more  IV 2010»
13 years 7 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
Takao Ito, Kazuo Misue, Jiro Tanaka
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
14 years 2 months ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen