1605 search results - page 135 / 321 » On Partitional Labelings of Graphs |
80
Voted
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
In many clustering applications, the user has some vague notion of the number and membership of the desired clusters. However, it is difficult for the user to provide such knowled...
104
Voted
SIAMDM
2008
15 years 16 days ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
87
Voted
DSD
2010
IEEE
15 years 25 days ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
121
click to vote
ALMOB
2006
15 years 21 days ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
132
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...