1952 search results - page 129 / 391 » Complete partitions of graphs |
161
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
129
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
150
click to vote
RSA
2008
15 years 3 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
195
click to vote
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...
172
click to vote
NIPS
2008
15 years 5 months ago
2008
Semantic hashing[1] seeks compact binary codes of data-points so that the Hamming distance between codewords correlates with semantic similarity. In this paper, we show that the p...