Sciweavers

286 search results - page 19 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
CCS
2009
ACM
16 years 9 days ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
COCOON
2008
Springer
15 years 1 months ago
Probe Ptolemaic Graphs
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van...
SIAMDM
1998
95views more  SIAMDM 1998»
14 years 11 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
ECAI
2008
Springer
15 years 1 months ago
Sequential spatial reasoning in images based on pre-attention mechanisms and fuzzy attribute graphs
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics, and graphs...
Geoffroy Fouquier, Jamal Atif, Isabelle Bloch
DAGSTUHL
2006
15 years 1 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...