Sciweavers

135 search results - page 6 / 27
» Edge-pancyclicity of coupled graphs
Sort
View
CVPR
2004
IEEE
13 years 11 months ago
Modeling Complex Motion by Tracking and Editing Hidden Markov Graphs
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
Yizhou Wang, Song Chun Zhu
EDBT
2011
ACM
197views Database» more  EDBT 2011»
12 years 11 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
DAGSTUHL
2006
13 years 8 months ago
Partial Matching by Structural Descriptors
The extended abstract describes a method for recognizing similar sub-parts of objects described by 3D polygonal meshes. The innovation of this method is the coupling of structure a...
Simone Marini, Silvia Biasotti, Bianca Falcidieno
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
Luh Yen, François Fouss, Christine Decaeste...
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 2 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...