Sciweavers

7150 search results - page 419 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
CAGD
2005
116views more  CAGD 2005»
15 years 6 months ago
A sharpness dependent filter for mesh smoothing
In this paper, we propose a sharpness dependent filter design based on the fairing of surface normal, whereby the filtering algorithm automatically selects a filter. This may be a...
Chun-Yen Chen, Kuo-Young Cheng
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
16 years 7 days ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
ATAL
2010
Springer
15 years 8 months ago
Divide-and-coordinate: DCOPs by agreement
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
Meritxell Vinyals, Marc Pujol, Juan A. Rodrí...
DCG
2008
93views more  DCG 2008»
15 years 7 months ago
Robust Shape Fitting via Peeling and Grating Coresets
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
SIAMDM
2002
124views more  SIAMDM 2002»
15 years 6 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella