Sciweavers

813 search results - page 100 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
ICMCS
2006
IEEE
143views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Object Recognition and Recovery by Skeleton Graph Matching
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...
Lei He, Chia Y. Han, William G. Wee
KDD
2007
ACM
201views Data Mining» more  KDD 2007»
14 years 9 months ago
Structural and temporal analysis of the blogosphere through community factorization
The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel tech...
Yun Chi, Shenghuo Zhu, Xiaodan Song, Jun'ichi Tate...
CIKM
2010
Springer
13 years 7 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 9 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
3DIM
2003
IEEE
14 years 2 months ago
A Discrete Reeb Graph Approach for the Segmentation of Human Body Scans
Segmentation of 3D human body (HB) scan is a very challenging problem in applications exploiting human scan data. To tackle this problem, this paper proposes a topological approac...
Yijun Xiao, Paul Siebert, Naoufel Werghi