Sciweavers

2569 search results - page 68 / 514
» Approximate Objects and Approximate Theories
Sort
View
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
16 years 5 days ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin
ATAL
2007
Springer
15 years 6 months ago
Constraint satisfaction algorithms for graphical games
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
Vishal Soni, Satinder P. Singh, Michael P. Wellman
CVPR
2004
IEEE
16 years 1 months ago
Approximation of Canonical Sets and Their Applications to 2D View Simplification
Given a set of patterns and a similarity measure between them, we will present an optimization framework to approximate a small subset, known as a canonical set, whose members clo...
Trip Denton, Jeff Abrahamson, Ali Shokoufandeh
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 6 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis
SCIA
2007
Springer
131views Image Analysis» more  SCIA 2007»
15 years 6 months ago
Performance Comparison of Techniques for Approximating Image-Based Lighting by Directional Light Sources
Abstract. Image-Based Lighting (IBL) has become a very popular approach in computer graphics. In essence IBL is based on capturing the illumination conditions in a scene in an omni...
Claus B. Madsen, Rune E. Laursen