Sciweavers

1082 search results - page 21 / 217
» Approximation Algorithms for Spreading Points
Sort
View
CCCG
2007
13 years 9 months ago
Approximation Algorithms for the Minimum-Length Corridor and Related Problems
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
APPROX
2010
Springer
160views Algorithms» more  APPROX 2010»
13 years 7 months ago
Proximity Algorithms for Nearly-Doubling Spaces
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
Lee-Ad Gottlieb, Robert Krauthgamer
ICML
2002
IEEE
14 years 8 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
JCO
2010
169views more  JCO 2010»
13 years 6 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
IPMI
2001
Springer
14 years 8 months ago
A Sequential 3D Thinning Algorithm and Its Medical Applications
Skeleton is a frequently applied shape feature to represent the general form of an object. Thinning is an iterative object reduction technique for producing a reasonable approximat...
Kálmán Palágyi, Erich Soranti...