Sciweavers

1261 search results - page 80 / 253
» Approximation algorithms for aligning points
Sort
View
CP
2008
Springer
14 years 11 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
COCOON
2010
Springer
15 years 2 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
ICIP
2001
IEEE
15 years 11 months ago
Improving a genetic algorithm segmentation by means of a fast edge detection technique
Thispaper presents a new hybrid range image segmentation approach. Two separate techniques are applied consecutively. First, iin edge based segmentation technique extracts the edg...
Angel Domingo Sappa, Vitoantonio Bevilacqua, Miche...
CAGD
2008
119views more  CAGD 2008»
14 years 8 months ago
A local fitting algorithm for converting planar curves to B-splines
In this paper we present a local fitting algorithm for converting smooth planar curves to Bsplines. For a smooth planar curve a set of points together with their tangent vectors a...
Chongyang Deng, Xunnian Yang
ISAAC
2005
Springer
100views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Separability with Outliers
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
Sariel Har-Peled, Vladlen Koltun