838 search results - page 151 / 168 » Finding Optimal Solutions to Atomix |
CIBCB
2007
IEEE
15 years 6 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
120
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
We present a new class of deformable models, MetaMorphs, whose formulation integrates both shape and interior texture. The model deformations are derived from both boundary and re...
114
Voted
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
The accurate localization of facial features plays a fundamental
role in any face recognition pipeline. Constrained
local models (CLM) provide an effective approach to localizati...