Sciweavers

7006 search results - page 275 / 1402
» Approximation Algorithms
Sort
View
118
Voted
COMGEO
1999
ACM
15 years 3 months ago
Optimal triangulation and quadric-based surface simplification
Many algorithms for reducing the number of triangles in a surface model have been proposed, but to date there has been little theoretical analysis of the approximations they produ...
Paul S. Heckbert, Michael Garland
158
Voted
FOCS
2009
IEEE
15 years 10 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
125
Voted
AAAI
2007
15 years 6 months ago
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
Martin Zinkevich, Michael H. Bowling, Neil Burch
166
Voted
IPCO
2008
129views Optimization» more  IPCO 2008»
15 years 5 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
125
Voted
ICIP
2003
IEEE
16 years 5 months ago
Approximation and compression of piecewise smooth images using a wavelet/wedgelet geometric model
Inherent to photograph-like images are two types of structures: large smooth regions and geometrically smooth edge contours separating those regions. Over the past years, efficien...
Justin K. Romberg, Michael B. Wakin, Richard G. Ba...