4539 search results - page 831 / 908 » Approaches to Compute Workflow Complexity |
122
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
221
click to vote
Publication
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
173
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
We propose a novel tracking algorithm for the target of which geometric appearance changes drastically over time. To track it, we present a local patch-based appearance model and p...
113
click to vote
CVPR
1998
IEEE
16 years 3 months ago
1998
IEEE
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
133
click to vote
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
The mean shift algorithm has achieved considerable success in object tracking due to its simplicity and robustness. It finds local minima of a similarity measure between the color...