429 search results - page 5 / 86 » Solving the Maximum Clique Problem Using PUBB |
ICPR
2006
IEEE
14 years 8 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...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
ECCV
1998
Springer
14 years 9 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
CPM
2000
Springer
13 years 12 months ago
2000
Springer
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...