503 search results - page 73 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
138
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
110
Voted
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper we introduce a novel circle detection algorithm based on a weighted minimum mean square error (MSE) formulation. Traditional approaches to circle detections consist ...
123
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
157
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
— We address the sparse signal recovery problem in the context of multiple measurement vectors (MMV) when elements in each nonzero row of the solution matrix are temporally corre...
130
click to vote
DAM
2007
15 years 3 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...