286 search results - page 47 / 58 » Recognition Algorithm for Diamond-Free Graphs |
PAMI
2006
14 years 9 months ago
2006
Viewpoint independent recognition of free-form objects and their segmentation in the presence of clutter and occlusions is a challenging task. We present a novel 3D model-based alg...
AMAI
2005
Springer
14 years 9 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
117
click to vote
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Object localization in an image is usually handled by searching for an optimal subwindow that tightly covers the object of interest. However, the subwindows considered in previous ...
EMNLP
2006
14 years 11 months ago
2006
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
SIGMOD
2010
ACM
14 years 9 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...