Sciweavers

3265 search results - page 68 / 653
» Representing Groups on Graphs
Sort
View
126
Voted
IFIP12
2007
15 years 5 months ago
Clustering Improves the Exploration of Graph Mining Results
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
210
Voted
ICBA
2004
Springer
271views Biometrics» more  ICBA 2004»
15 years 9 months ago
Enhance the Alignment Accuracy of Active Shape Models Using Elastic Graph Matching
Active Shape Model (ASM) is one of the most popular methods for image alignment. To improve its matching accuracy, in this paper, ASM searching method is combined with a simplifie...
Sanqiang Zhao, Wen Gao, Shiguang Shan, Baocai Yin
137
Voted
CIKM
2009
Springer
15 years 7 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
ICIP
2002
IEEE
16 years 5 months ago
On the non-optimality of four color coding of image partitions
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
Sameer Agarwal, Serge Belongie
113
Voted
ASWEC
2008
IEEE
15 years 10 months ago
An Exploration of Power-Law in Use-Relation of Java Software Systems
A software component graph, where a node represents a component and an edge represents a use-relation between components, is widely used for analysis methods of software engineeri...
Makoto Ichii, Makoto Matsushita, Katsuro Inoue