315 search results - page 56 / 63 » An Optimal Algorithm for the Maximum-Density Segment Problem |
CVPR
2006
IEEE
14 years 23 days ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
ICCS
2009
Springer
13 years 4 months ago
2009
Springer
The Jaccard/Tanimoto coefficient is an important workload, used in a large variety of problems including drug design fingerprinting, clustering analysis, similarity web searching a...
ACCV
2010
Springer
13 years 1 months ago
2010
Springer
Abstract. Robust foreground object segmentation via background modelling is a difficult problem in cluttered environments, where obtaining a clear view of the background to model i...
BMCBI
2006
13 years 6 months ago
2006
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
ECCV
2006
Springer
14 years 8 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...