246 search results - page 4 / 50 » Dynamic Local Search for the Maximum Clique Problem |
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
NIPS
2001
14 years 11 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
120
click to vote
IJCAI
2003
14 years 11 months ago
2003
Maximum satisfiability (Max-SAT) is more general and more difficult to solve than satisfiability (SAT). In this paper, we first investigate the effectiveness of Walksat, one of th...
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents Markov random fields (MRFs) to segment strokes of Chinese characters. The distortions caused by the thinning process make the thinning-based stroke segmentatio...
WEA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...