524 search results - page 21 / 105 » On the Maximum Number of Cliques in a Graph |
175
Voted
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and s...
142
click to vote
APPROX
2009
Springer
16 years 20 days ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
168
click to vote
AIRS
2006
Springer
15 years 9 months ago
2006
Springer
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
164
click to vote
SSPR
2004
Springer
15 years 11 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
168
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...