Sciweavers

3068 search results - page 280 / 614
» Clustering with Multiple Graphs
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Image Classification with Segmentation Graph Kernels
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
Francis Bach, Zaïd Harchaoui
ESOP
2004
Springer
16 years 2 days ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink
INFOVIS
2003
IEEE
15 years 12 months ago
EdgeLens: An Interactive Method for Managing Edge Congestion in Graphs
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
Nelson Wong, M. Sheelagh T. Carpendale, Saul Green...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 11 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 9 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri