Sciweavers

2304 search results - page 126 / 461
» On the Vulnerability of Large Graphs
Sort
View
ICIP
2008
IEEE
16 years 7 months ago
Live video object tracking and segmentation using graph cuts
Graph cuts have proven to be powerful tools in image segmentation. Previous graph cut research has proposed methods for cutting across large graphs constructed from multiple layer...
Zachary A. Garrett, Hideo Saito
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 6 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
GD
2005
Springer
15 years 11 months ago
Drawing Clustered Graphs in Three Dimensions
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 ...
Joshua Wing Kei Ho, Seok-Hee Hong
175
Voted
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 11 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
GG
2004
Springer
15 years 11 months ago
Constraints and Application Conditions: From Graphs to High-Level Structures
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl...