Sciweavers

1279 search results - page 114 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
FOCS
1995
IEEE
14 years 14 days ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
COMPGEOM
1996
ACM
14 years 1 months ago
Developing a Practical Projection-Based Parallel Delaunay Algorithm
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
Guy E. Blelloch, Gary L. Miller, Dafna Talmor
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 1 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
ICIP
2003
IEEE
14 years 10 months ago
A variational method for Bayesian blind image deconvolution
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
Aristidis Likas, Nikolas P. Galatsanos
ESA
2005
Springer
140views Algorithms» more  ESA 2005»
14 years 2 months ago
Bucket Game with Applications to Set Multicover and Dynamic Page Migration
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
Marcin Bienkowski, Jaroslaw Byrka