159 search results - page 19 / 32 » Computing minimum cuts by randomized search heuristics |
109
click to vote
COMPGEOM
2008
ACM
15 years 2 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
CCCG
2010
15 years 1 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...
EOR
2008
15 years 14 days ago
2008
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
101
Voted
DICTA
2003
15 years 1 months ago
2003
In this paper, we propose a robust method to estimate the fundamental matrix in the presence of outliers. The new method uses random minimum subsets as a search engine to find inli...
97
Voted
SAC
2004
ACM
15 years 5 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...